{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:03:38Z","timestamp":1774915418799,"version":"3.50.1"},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540582770","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0049331","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T13:58:16Z","timestamp":1141653496000},"page":"165-174","source":"Crossref","is-referenced-by-count":26,"title":["Petri nets and the equivalence problem"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Hirshfeld","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, J.A. Bergstra and J.W. Klop. Decidability of bisimulation equiv-alence for processes generating context free languages. In Proceedings of PARLE 87, LNCS 259, pp93\u2013114, Springer Verlag 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"12_CR2","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebra. Ph.D Thesis, Edinburgh University, 1993."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, F. Moller. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. In Proceedings of LICS93, IEEE Computer Society Press.","DOI":"10.1109\/LICS.1993.287569"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, F. Moller. Bisimulation equivalence is decidable for basic parallel processes. Proceedings of CONCUR93, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"12_CR5","unstructured":"J. Esparza. A note on BPP processes. Unpublished manuscript, University of Edinburgh, 1993."},{"key":"12_CR6","first-page":"278","volume":"458","author":"R. Glabbeek van","year":"1990","unstructured":"R. van Glabbeek. The linear time \u2014 branching time spectrum. In Proceedings of CONCUR90. LNCS 458, pp278\u2013297, 1990.","journal-title":"LNCS"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"J.F. Groote, H. H\u00fcttel. Undecidable equivalences for basic process algebra. Information and Computation, 1993.","DOI":"10.1006\/inco.1994.1101"},{"key":"12_CR8","unstructured":"M. Hack. Decision problems for Petri nets and vector addition systems. MAC Technical Memo 53, MIT, 1975."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(76)90008-6","volume":"2","author":"M. Hack","year":"1976","unstructured":"M. Hack. The equality problem for vector addition systems is undecidable. TCS 2, pp77\u201395, 1976.","journal-title":"TCS"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"M. Hennessy, R. Milner. Algebraic laws for nondeterminism and concurrency. JACM, Vol 32, No 1, 1985.","DOI":"10.1145\/2455.2460"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel. Undecidable equivalences for basic parallel processes. University of Edinburgh, 1993.","DOI":"10.1007\/3-540-57887-0_110"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar. Decidability questions for bisimilarity of Petri nets and some related problems. Proceedings of STACS94, Caen. LNCS 775, Springer Verlag pp581\u2013592, 1994.","DOI":"10.1007\/3-540-57785-8_173"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"S.R. Kosaraju. Decidability of reachability in vector addition systems. In Proceedings of the 6th Annual Symposium on the Theory of Computing, pp267\u2013281, 1982.","DOI":"10.1145\/800070.802201"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"E.W. Mayr. An algorithm for the general Petri net reachability problem. SIAM Journal of Computing 13, pp441\u2013460, 1984.","journal-title":"SIAM Journal of Computing"},{"key":"12_CR15","unstructured":"R. Milner. Communication and Concurrence. Prentice Hall 1989."},{"key":"12_CR16","unstructured":"M. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, 1967."},{"key":"12_CR17","unstructured":"W. Reisig. Petri Nets. Springer Verlag, 1982."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049331.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T13:39:26Z","timestamp":1683380366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540582770"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0049331","relation":{},"subject":[]}}