Browse by author
Lookup NU author(s): Dr Victor Khomenko
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
We integrate two compact data structures for representing state spaces of Petri nets: merged processes and contextual prefixes. The resulting data structure, called contextual merged processes (CMP), combines the advantages of the original ones and copes with several important sources of state space explosion: concurrency, sequences of choices, and concurrent read accesses to shared resources. In particular, we demonstrate on a number of benchmarks that CMPs are more compact than either of the original data structures. Moreover, we sketch a polynomial (in the CMP size) encoding into SAT of the model-checking problem for reachability properties.
Author(s): Rodriguez C, Schwoon S, Khomenko V
Editor(s): Colom, J.M. and Desel, J.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 34th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets)
Year of Conference: 2013
Pages: 29-48
ISSN: 0302-9743
Publisher: Springer Verlag
URL: http://dx.doi.org/10.1007/978-3-642-38697-8_3
DOI: 10.1007/978-3-642-38697-8_3
Notes: Online ISSN: 1611-3349 Online ISBN: 9783642386978
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783642386961
