{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:10:40Z","timestamp":1773943840754,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404934","type":"print"},{"value":"9783540450610","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_46","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:04Z","timestamp":1184601244000},"page":"570-583","source":"Crossref","is-referenced-by-count":10,"title":["Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes"],"prefix":"10.1007","author":[{"given":"Richard","family":"Mayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, chapter 9, pages 545\u2013623. Elsevier Science, 2001.","DOI":"10.1016\/B978-044482830-9\/50027-8"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","volume":"148","author":"P. Jan\u010dar","year":"1995","unstructured":"P. Jan\u010dar. Undecidability of bisimilarity for Petri nets and some related problems. TCS, 148:281\u2013301, 1995.","journal-title":"TCS"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1999.2813","volume":"158","author":"P. Jan\u010dar","year":"2000","unstructured":"P. Jan\u010dar. Decidability of bisimilarity for one-counter processes. Information and Computation, 158:1\u201317, 2000.","journal-title":"Information and Computation"},{"issue":"1","key":"46_CR4","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"R. Mayr. Process rewrite systems. Information and Computation, 156(1):264\u2013286, 2000.","journal-title":"Information and Computation"},{"key":"46_CR5","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"46_CR6","unstructured":"M.L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967."},{"key":"46_CR7","unstructured":"J.L. Peterson. Petri net theory and the modeling of systems. Prentice-Hall, 1981."},{"key":"46_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-45500-0_19","volume-title":"Proc.of TACS 2001","author":"Ph. Schnoebelen","year":"2001","unstructured":"Ph. Schnoebelen. Bisimulation and other undecidable equivalences for lossy channel systems. In Proc.of TACS 2001, volume 2215 of LNCS, pages 385\u2013399. Springer Verlag, 2001."},{"key":"46_CR9","unstructured":"G. S\u00e9nizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Proc.of FOCS\u201998. IEEE, 1998."},{"key":"46_CR10","first-page":"163","volume":"78","author":"J. Srba","year":"2002","unstructured":"J. Srba. Roadmap of infinite results. Bulletin of the European Association for Theoretical Computer Science, 78:163\u2013175, October 2002. Columns: Concurrency. Regularly updated online version at http:\/\/www.brics.dk\/~srba\/roadmap.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"46_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Proc. Developments in Languague Theory 2002","author":"J. Srba","year":"2002","unstructured":"J. Srba. Undecidability of weak bisimilarity for PA-processes. In Proc. Developments in Languague Theory 2002, LNCS. Springer-Verlag, 2002. To appear."},{"key":"46_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/3-540-45694-5_38","volume-title":"Proc. of CONCUR 2002","author":"J. Srba","year":"2002","unstructured":"J. Srba. Undecidability of weak bisimilarity for pushdown processes. In Proc. of CONCUR 2002, volume 2421 of LNCS, pages 579\u2013593. Springer Verlag, 2002."},{"key":"46_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BFb0055763","volume-title":"Proc.of MFCS\u201998","author":"C. Stirling","year":"1998","unstructured":"C. Stirling. The joys of bisimulation. In Proc.of MFCS\u201998, volume 1450 of LNCS, pages 142\u2013151. Springer Verlag, 1998."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T23:41:13Z","timestamp":1550446873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_46","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}