ePrints

Direct Construction of Complete Merged Processes

Lookup NU author(s): Dr Victor Khomenko, Dr Andrey Mokhov

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

Merged processes (MPs) are a recently proposed condensed representation of a Petri net's behaviour similar to branching processes (unfoldings), which copes well not only with concurrency but also with other sources of state space explosion like sequences of choices. They are by orders of magnitude more compact than traditional unfoldings, and yet can be used for efficient model checking. However, constructing complete MPs is difficult, and the only known algorithm is based on building a (potentially much larger) complete unfolding prefix of a Petri net, whose nodes are then merged. Obviously, this significantly reduces their appeal as a representation that can be used for practical model checking. In this paper, we develop an algorithm that avoids constructing the intermediate unfolding prefix and builds a complete merged process directly from a safe Petri net. In particular, a challenging problem of truncating a merged process is solved.

Publication metadata

Author(s): Khomenko V, Mokhov A

Publication type: Article

Publication status: Published

Journal: The Computer Journal

Year: 2014

Volume: 57

Issue: 5

Pages: 693-707

Print publication date: 01/05/2014

Online publication date: 01/05/2014

Acceptance date: 01/01/1900

ISSN (print): 0010-4620

ISSN (electronic): 1460-2067

Publisher: Oxford University Press

URL: http://dx.doi.org/10.1093/comjnl/bxt014

DOI: 10.1093/comjnl/bxt014

Notes: epub:18/02/2013

Altmetrics

Funding

Share