Decidability questions for bisimilarity of Petri nets and some related problems
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Bisimulation equivalence is decidable for all context-free processesPublished by Springer Nature ,2006
- Bisimulation equivalence is decidable for basic parallel processesPublished by Springer Nature ,1993
- Strong bisimilarity on nets revisitedPublished by Springer Nature ,1991
- 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
- The equality problem for vector addition systems is undecidableTheoretical Computer Science, 1976
- Rational sets in commutative monoidsJournal of Algebra, 1969
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966