Abstract
The main result is undecidability of bisimilarity for labelled (place / transition) Petri nets. The same technique applies to the (prefix) language equivalence and reachability set equality, which yields stronger versions with simpler proofs of already known results. The paper also mentions decidability of bisimilarity if one of the nets is deterministic up to bisimilarity. Another decidability result concerns semilinear bisimulations and extends the result of [CHM93] for Basic Parallel Processes (BPP).
Cite
CITATION STYLE
Jančar, P. (1994). Decidability questions for bisimilarity of Petri nets and some related problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 581–592). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_173
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
