The Reachability Problem in Petri Nets: Decidability and Hardness
- 1 June 2026
- book chapter
- Published by Springer Nature
- p. 123-149
Abstract
No abstract availableThis publication has 37 references indexed in Scilit:
- Verification of population protocolsActa Informatica, 2016
- Business process management as the “Killer App” for Petri netsSoftware and Systems Modeling, 2014
- Ordered Navigation on Multi-attributed Data WordsLecture Notes in Computer Science, 2014
- Petri nets for modelling metabolic pathways: a surveyNatural Computing, 2010
- A theory of structural stationarity in the π-CalculusActa Informatica, 2009
- Petri nets, Horn programs, Linear Logic and vector gamesAnnals of Pure and Applied Logic, 1995
- A structure to decide reachability in Petri netsTheoretical Computer Science, 1992
- On the reachability problem for 5-dimensional vector addition systemsTheoretical Computer Science, 1979
- Remarks on blind and partially blind one-way multicounter machinesTheoretical Computer Science, 1978
- Hierarchies of number-theoretic functions. IArchive for Mathematical Logic, 1970