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).
Partly supported by the Grant Agency of Czech Republic, Grant No. 201/93/2123
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Autant C., Belmesk Z., Schnoebelen Ph.: Strong bisimilarity on nets revisited; PARLE'91, LNCS 506, 295–312
Baker H.: Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems; MAC — Memo 79, MIT (1973)
Christensen S., Hüttel H., Stirling C.: Bisimulation equivalence is decidable for all context-free processes; CONCUR'92, LNCS 630, 138–147
Christensen S., Hirshfeld Y., Moller F.: Bisimulation equivalence is decidable for all Basic Parallel Processes; CONCUR'93, LNCS 715, 143–157
Eilenberg S., Schützenberger M.: Rational sets in commutative monoids; J. of Algebra 13, 1969, 173–191
Ginsburg S., Spanier E.: Semigroups, Presburger formulas, and languages; Pacific J.of Mathematics, 16(2), 1966, 285–296
Hack M.: Decision problems for Petri nets and vector addition systems; MAC Tech.Memo 53, MIT (1975)
Hack M.: The equality problem for vector addition systems is undecidable; TCS 2, 1976, 77–95
Hirshfeld Y.: Petri nets and the equivalence problem; to appear in Proc. of Computer Science Logic '93; Swansea, Wales, September 13–17, 1993.
Hopcroft J., Pansiot J.: On the reachability problem for 5-dimensional vector addition systems; TCS 8, 1979, 135–159
Howell R., Rosier L., Huynh D., Yen H.: Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states; TCS 46, 1986, 107–140
Jančar P.: Decidability questions for bisimilarity of Petri nets and some related problems; Techn. rep. ECS-LFCS-93-261, Univ. of Edinburgh, UK, April 1993
Mayr E.: An algorithm for the general Petri net reachability problem; SIAM J.Comput. 13(3), 1984, 441–460
Minsky M.: Computation: Finite and Infinite Machines; Prentice Hall, 1967
Milner R.: Communication and Concurrency; Prentice Hall 1989
Oppen D.C.: A \(2^{2^{2^{pn} } }\) upper bound on the complexity of Presburger Arithmetic; JCSS 16, 1978, 323–332
Peterson J.L.: Petri Net Theory and the Modeling of Systems; Prentice Hall 1981
Valk R., Vidal-Naquet G.: Petri nets and regular languages; JCSS 23, 1981, 299–325
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jančar, P. (1994). Decidability questions for bisimilarity of Petri nets and some related problems. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_173
Download citation
DOI: https://doi.org/10.1007/3-540-57785-8_173
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57785-0
Online ISBN: 978-3-540-48332-8
eBook Packages: Springer Book Archive