{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T15:03:20Z","timestamp":1561388600722},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540572084","type":"print"},{"value":"9783540479680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57208-2_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:17:51Z","timestamp":1330258671000},"page":"143-157","source":"Crossref","is-referenced-by-count":65,"title":["Bisimulation equivalence is decidable for basic parallel processes"],"prefix":"10.1007","author":[{"given":"S\u00f8ren","family":"Christensen","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Hirshfeld","sequence":"additional","affiliation":[]},{"given":"Faron","family":"Moller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"11_CR1","unstructured":"J.C.M. Baeten, J.A. Bergstra and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE 87, J.W. de Bakker, A.J. Nijman, P.C. Treleaven (eds), Lecture Notes in Computer Science 259, pp93\u2013114. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-17945-3_5","doi-asserted-by":"crossref"},{"key":"11_CR2","unstructured":"I. Castellani. Bisimulations for Concurrency. PhD thesis CST-51-88. University of Edinburgh, 1988."},{"issue":"4","key":"11_CR3","first-page":"339","volume":"24","author":"D. Caucal","year":"1990","unstructured":"D. Caucal. Graphes canoniques des graphes alg\u00e9briques. Informatique Th\u00e9orique et Applications (RAIRO) 24(4), pp339\u2013352, 1990.","journal-title":"Informatique Th\u00e9orique et Applications (RAIRO)"},{"key":"11_CR4","unstructured":"S. Christensen. Distributed bisimilarity is decidable for a class of infinite-state systems. In Proceedings of CONCUR 92, W.R. Cleaveland (ed), Lecture Notes in Computer Science 630, pp148\u2013161. Springer-Verlag, 1992.","DOI":"10.1007\/BFb0084789","doi-asserted-by":"crossref"},{"key":"11_CR5","unstructured":"S. Christensen. Forthcoming PhD thesis. University of Edinburgh, 1993."},{"key":"11_CR6","unstructured":"S. Christensen, Y. Hirschfeld and F. Moller. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. In Proceedings of LICS93. IEEE Computer Society Press, 1993.","DOI":"10.1109\/LICS.1993.287569","doi-asserted-by":"crossref"},{"key":"11_CR7","unstructured":"S. Christensen, H. H\u00fcttel and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR 92, W.R. Cleaveland (ed), Lecture Notes in Computer Science 630, pp138\u2013147. Springer-Verlag, 1992.","DOI":"10.1007\/BFb0084788","doi-asserted-by":"crossref"},{"key":"11_CR8","unstructured":"R.J. van Glabbeek. The linear time-branching time spectrum. In Proceedings of CONCUR 90, J. Baeten, J.W. Klop (eds), Lecture Notes in Computer Science 458, pp278\u2013297. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0039066","doi-asserted-by":"crossref"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","volume":"42","author":"J. F. Groote","year":"1991","unstructured":"J.F. Groote. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters 42, pp167\u2013171, 1991.","journal-title":"Information Processing Letters"},{"key":"11_CR10","unstructured":"J.F. Groote and H. H\u00fcttel. Undecidable equivalences for basic process algebra. Research report ECS-LFCS-91-169. University of Edinburgh, August 1991."},{"key":"11_CR11","unstructured":"Y. Hirshfeld. Finitely generated processes, Petri nets and the equivalence problem. Unpublished notes, University of Edinburgh, May 1993."},{"key":"11_CR12","unstructured":"H. H\u00fcttel. Decidability, Behavioural Equivalences and Infinite Transition Graphs. PhD thesis CST-86-91. University of Edinburgh, December 1991."},{"key":"11_CR13","unstructured":"H. H\u00fcttel and C. Stirling. Actions speak louder than words: proving bisimilarity for context-free processes. In Proceedings of LICS 91, pp376\u2013386. IEEE Computer Society Press, 1991."},{"key":"11_CR14","unstructured":"D.T. Huynh and L. Tian. On deciding readiness and failures equivalences for processes. Research report UTDCS-31-90. University of Texas at Dallas, September 1990."},{"key":"11_CR15","unstructured":"P. Jan\u010dar. Decidability questions for bisimilarity of Petri nets and some related problems. Research report ECS-LFCS-93-261. University of Edinburgh, April 1993."},{"key":"11_CR16","unstructured":"D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In Proceedings of LICS 91, pp214\u2013225. IEEE Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151646","doi-asserted-by":"crossref"},{"key":"11_CR17","first-page":"110","volume":"47","author":"E. Madelaine","year":"1992","unstructured":"Madelaine, E., Verification tools from the CONCUR project. Bulletin of the European Association of Theoretical Computer Science 47, pp110\u2013126, June 1992.","journal-title":"Bulletin of the European Association of Theoretical Computer Science"},{"key":"11_CR18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences 28, pp439\u2013466, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR19","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"11_CR20","first-page":"226","volume":"41","author":"R. Milner","year":"1990","unstructured":"R. Milner and F. Moller. Unique decomposition of processes. Bulletin of the European Association for Theoretical Computer Science 41, pp226\u2013232, 1990.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"11_CR21","unstructured":"F. Moller. Axioms for Concurrency. PhD thesis CST-59-89. University of Edinburgh, 1989."},{"key":"11_CR22","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"A. Salomaa, Two complete axiom systems for the algebra of regular events. Journal of the Association of Computing Machinery 13, pp158\u2013169, 1966.","journal-title":"Journal of the Association of Computing Machinery"}],"container-title":["CONCUR'93","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/3-540-57208-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T08:04:58Z","timestamp":1549094698000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572084","9783540479680"],"references-count":22,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-57208-2_11","relation":{"cites":[]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}]}}