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. © 2013 Springer-Verlag.
CITATION STYLE
Rodríguez, C., Schwoon, S., & Khomenko, V. (2013). Contextual merged processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7927 LNCS, pp. 29–48). https://doi.org/10.1007/978-3-642-38697-8_3
Mendeley helps you to discover research relevant for your work.