Undecidability of bisimilarity for Petri nets and some related problems
- 4 September 1995
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 148 (2), 281-301
- https://doi.org/10.1016/0304-3975(95)00037-w
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Decidability of a temporal logic problem for Petri netsTheoretical Computer Science, 1990
- Bismulation and effectivenessInformation Processing Letters, 1989
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with statesTheoretical Computer Science, 1986
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984
- On the reachability problem for 5-dimensional vector addition systemsTheoretical Computer Science, 1979
- A 222pn upper bound on the complexity of Presburger ArithmeticJournal of Computer and System Sciences, 1978
- The equality problem for vector addition systems is undecidableTheoretical Computer Science, 1976
- Rational sets in commutative monoidsJournal of Algebra, 1969
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966