The reachability problem for Petri nets is not elementary

@article{Czerwinski2019TheRP,
  title={The reachability problem for Petri nets is not elementary},
  author={Wojciech Czerwinski and S. Lasota and R. Lazic and J{\'e}r{\^o}me Leroux and F. Mazowiecki},
  journal={Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing},
  year={2019}
}
Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained… Expand
When Reachability Meets Grzegorczyk
Reachability in fixed dimension vector addition systems with states
Structural liveness of Petri nets is ExpSpace-hard and decidable
Parameterized Analysis of Immediate Observation Petri Nets
Critical Observability for Automata and Petri Nets
  • T. Masopust
  • Computer Science
  • IEEE Transactions on Automatic Control
  • 2020
Continuous Reachability for Unordered Data Petri nets is in PTime
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
The Covering and Boundedness Problems for Vector Addition Systems
  • C. Rackoff
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1978
The reachability problem requires exponential space
  • Technical Report 62, Yale University,
  • 1976