{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:39:45Z","timestamp":1760146785409,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662242"},{"type":"electronic","value":"9783540485230"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48523-6_38","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T12:06:31Z","timestamp":1197288391000},"page":"412-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract)"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Hirshfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,1,18]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/174130.174141","volume":"40","author":"J.C.M. Baeten","year":"1993","unstructured":"J.C.M. Baeten, J.A. Bergstra and J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, Journal of the ACM 40 (1993), 653\u2013682.","journal-title":"Journal of the ACM"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction. Theoretical Computer Science 37 (1985), 77\u2013121.","journal-title":"Theoretical Computer Science"},{"key":"38_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/3-540-60246-1_148","volume-title":"Proceedings of MFCS\u2019 95: 20th International Symposium on Mathematical Foundations of Computer Science","author":"O. Burkart","year":"1995","unstructured":"Olaf Burkart, Didier Caucal and Bernhard Steffen, An elementary bisimulation decision procedure for arbitrary context-free processes. Proceedings of MFCS\u2019 95: 20th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 969, Springer-Verlag, 1995, 423\u2013433."},{"key":"38_CR4","unstructured":"S\u00f8ren Christensen, Decidability and Decomposition in Process Algebras (PhD. Thesis). Internal Report ECS-LFCS-93-278, Laboratory for Foundations of Computer Science, University of Edinburgh, September 1993."},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"S\u00f8ren Christensen, Yoram Hirshfeld, and Faron Moller, Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science (LICS 93), IEEE Computer Society Press, 1993, 386\u2013396.","DOI":"10.1109\/LICS.1993.287569"},{"key":"38_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"Proceedings of CONCUR 93: Fourth International Conference on Concurrency Theory","author":"S. Christensen","year":"1993","unstructured":"S\u00f8ren Christensen, Yoram Hirshfeld, and Faron Moller, Bisimulation equivalence is decidable for basic parallel processes. Proceedings of CONCUR 93: Fourth International Conference on Concurrency Theory, Lecture Notes in Computer Science 715, Springer-Verlag, 1993, 143\u2013157."},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"S\u00f8ren Christensen, Hans H\u00dcttel and Colin STIRLING, Bisimulation equivalence is decidable for all context-free processes, Information and Computation 121 (1995), 143\u2013148.","journal-title":"Information and Computation"},{"key":"38_CR8","unstructured":"Yoram Hirshfeld and Mark Jerrum, Bisimulation equivalence is decidable for normed Process Algebra, Internal Report ECS-LFCS-98-386, Laboratory for Foundations of Computer Science, University of Edinburgh, May 1998. URL: http:\/\/www.dcs.ed.ac.uk\/lfcsreps\/EXPORT\/98\/ECS-LFCS-98-386\/index.html."},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"158","author":"Y. Hirshfeld","year":"1996","unstructured":"Yoram Hirshfeld, Mark Jerrum and Faron Moller, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Theoretical Computer Science 158 (1996), 143\u2013159.","journal-title":"Theoretical Computer Science"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1017\/S0960129500000992","volume":"6","author":"Y. Hirshfeld","year":"1996","unstructured":"Yoram Hirshfeld, Mark Jerrum and Faron Moller, A polynomial algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes, Mathematical Structures in Computer Science 6 (1996), 251\u2013259.","journal-title":"Mathematical Structures in Computer Science"},{"key":"38_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-63141-0_21","volume-title":"Proceedings of CONCUR 97: Eighth International Conference on Concurrency Theory","author":"A. Ku\u010cera","year":"1997","unstructured":"Anton\u00edn Ku\u010cera, How to parallelize sequential processes. Proceedings of CONCUR 97: Eighth International Conference on Concurrency Theory, Lecture Notes in Computer Science 1243, Springer-Verlag, 1997, 302\u2013316."},{"key":"38_CR12","unstructured":"Robin Milner, Communication and Concurrency, Prentice Hall, 1989."},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0304-3975(93)90176-T","volume":"107","author":"R. Milner","year":"1993","unstructured":"Robin Milner and Faron Moller, Unique decomposition of processes, Theoretical Computer Science 107 (1993), 357\u2013363.","journal-title":"Theoretical Computer Science"},{"key":"38_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science: Fifth GI-Conference","author":"D.M.R. Park","year":"1981","unstructured":"D.M.R. Park, Concurrency and Automata on Infinite Sequences. Theoretical Computer Science: Fifth GI-Conference, Lecture Notes in Computer Science104, Springer-Verlag, 1981, 167\u2013183."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T13:49:44Z","timestamp":1737640184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}