We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lipton, can be adapted and extended to obtain new lower bounds for the coverability problem for two prominent classes of systems based on Petri nets: Ackermann-hardness for unordered data Petri nets, and Tower-hardness for pushdown vector addition systems.
CITATION STYLE
Lazić, R., & Totzke, P. (2017). What makes Petri nets harder to verify: Stack or data? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10160, pp. 144–161). Springer Verlag. https://doi.org/10.1007/978-3-319-51046-0_8
Mendeley helps you to discover research relevant for your work.