We introduce a divide-and-conquer algorithm for a modified version of the reachability/coverability problem in 1-bounded Petri nets that relies on the compositional algebra of nets with boundaries: we consider the algebraic decomposition of the net of interest as part of the input. We formally prove the correctness of the technique and contrast the performance of our implementation with state-of-the-art tools that exploit partial order reduction techniques on the global net.
CITATION STYLE
Rathke, J., Sobociński, P., & Stephens, O. (2014). Compositional reachability in petri nets. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8762, 230–243. https://doi.org/10.1007/978-3-319-11439-2_18
Mendeley helps you to discover research relevant for your work.