{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:23:45Z","timestamp":1736659425396,"version":"3.32.0"},"reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084789","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"148-161","source":"Crossref","is-referenced-by-count":7,"title":["Distributed bisimularity is decidable for a class of infinite state-space systems"],"prefix":"10.1007","author":[{"given":"S\u00f8ren","family":"Christensen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","first-page":"93","volume":"259","author":"J.C.M. Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. LNCS 259, pp 93\u2013114, 1987.","journal-title":"LNCS"},{"key":"12_CR2","unstructured":"I. Castellani. Bisimulation for Concurrency. Ph.D. Thesis, Edinburgh University, CST-51-88, 1988."},{"key":"12_CR3","unstructured":"D. Caucal. Graphes Canoniques de Graphes Algebriques. Report de Recherche 972, INRIA, Juillet 1988."},{"key":"12_CR4","first-page":"278","volume":"458","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek. The Linear Time-Branching Time Spectrum. CONCUR90, LNCS 458, pp 278\u2013297, 1990.","journal-title":"LNCS"},{"key":"12_CR5","unstructured":"J.F. Groote and H. H\u00fcttel. Undecidable Equivalences for Basic Process Algebra. University of Edinburgh, LFCS Report Series, ECS-LFCS-91-169, 1991."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel and C. Stirling. Actions Speak Louder that Words: Proving Bisimularity for Context-Free Processes. In Proceedings of 6th Annual Symposium on Logic in Computer Science (LICS 91), pp 376\u2013386, IEEE Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151661"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel. Silence is Golden: Branching Bisimularity is Decidable for Context-Free Processes. In Proceedings of the 3rd International Workshop on Computer-Aided Verification (CAV91), 1991.","DOI":"10.1007\/3-540-55179-4_2"},{"key":"12_CR8","volume-title":"Technical Report UTDCS-31-90","author":"D.T. Huynh","year":"1990","unstructured":"D.T. Huynh and L. Tian. On deciding Readiness and Failure equivalences for Processes. Technical Report UTDCS-31-90, University of Texas at Dallas, 1990."},{"key":"12_CR9","unstructured":"A. Kiehn. Distributed Bisimulations for Finite CCS, University of Sussex, Dept. of Computer Science, Report no. 7\/89, 1989."},{"key":"12_CR10","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner. A Complete Axiomatisation for Observational Congruence of Finite-State Behaviours. Journal of Information and Computation, Vol. 81, No. 2, May 1989.","DOI":"10.1016\/0890-5401(89)90070-9"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084789.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T03:55:39Z","timestamp":1736654139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0084789","relation":{},"subject":[]}}