{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T02:25:53Z","timestamp":1655778353336},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540179450","type":"print"},{"value":"9783540471813","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17945-3_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:21:13Z","timestamp":1330197673000},"page":"94-111","source":"Crossref","is-referenced-by-count":47,"title":["Decidability of bisimulation equivalence for processes generating context-free languages"],"prefix":"10.1007","author":[{"given":"J. C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"J. A.","family":"Bergstra","sequence":"additional","affiliation":[]},{"given":"J. W.","family":"Klop","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"5_CR1","volume-title":"Global renaming operators in concrete process algebra, Report CS-R8521","author":"J. C. M. M. Baeten","year":"1985","unstructured":"J.C.M. Baeten, J.A. Bergstra, Global renaming operators in concrete process algebra, Report CS-R8521, Centre for Mathematics and Computer Science, Amsterdam 1985."},{"key":"5_CR2","volume-title":"On the consistency of Koomen's Fair Abstraction Rule, Report CS-R8511","author":"J. C. M. M. Baeten","year":"1985","unstructured":"J.C.M. Baeten, J.A. Bergstra, J.W. Klop, On the consistency of Koomen's Fair Abstraction Rule, Report CS-R8511, Centre for Mathematics and Computer Science, Amsterdam 1985. To appear in Theoret. Comput. Sci."},{"key":"5_CR3","volume-title":"Decidability of bisimulation equivalence for processes generating context-free languages, Report CS-R8632","author":"J. C. M. M. Baeten","year":"1986","unstructured":"J.C.M. Baeten, J.A. Bergstra, J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, Report CS-R8632, Centre for Mathematics and Computer Science, Amsterdam 1986."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"J.W. de Bakker, J.A. Bergstra, J.W. Klop, J.-J.Ch. Meyer, Linear time and branching time semantics for recursion with merge, in: Proc. 10th ICALP, Barcelona (J. D\u00edaz, Ed.), Springer LNCS 154, 39\u201351, 1983; expanded version: Theoret. Comput. Sci. 34 (1984) 135\u2013156.","DOI":"10.1016\/0304-3975(84)90114-2"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"S.D. Brookes, C.A.R. Hoare, W. Roscoe, A Theory of Communicating Sequential Processes, J. Assoc. Comput. Mach. 31, No.3, 560\u2013599.","DOI":"10.1145\/828.833"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. A. Bergstra","year":"1984","unstructured":"J.A. Bergstra, J.W. Klop, Process algebra for synchronous communication, Inform. and Control 60 (1984) 109\u2013137.","journal-title":"Inform. and Control"},{"key":"5_CR7","volume-title":"Proc. CWI Symp. Math. and Comp. Sci.","author":"J. A. Bergstra","year":"1986","unstructured":"J.A. Bergstra, J.W. Klop, Algebra of communicating processes, in: J.W. de Bakker, M. Hazewinkel, J.K. Lenstra, Eds., Proc. CWI Symp. Math. and Comp. Sci., North-Holland, Amsterdam 1986."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra, J.W. Klop, The algebra of recursively defined processes and the algebra of regular processes, in: Proc. 11th ICALP, Antwerpen (J. Paredaens, Ed.), Springer LNCS 172, 82\u201394, 1984.","DOI":"10.1007\/3-540-13345-3_7"},{"key":"5_CR9","volume-title":"Readies and failures in the algebra of communicating processes, Report CS-R8523","author":"J. A. Bergstra","year":"1985","unstructured":"J.A. Bergstra, J.W. Klop, E.-R. Olderog, Readies and failures in the algebra of communicating processes, Report CS-R8523, Centre for Mathematics and Computer Science, Amsterdam 1985."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog, J.I. Zucker, Transition systems, infinitary languages and the semantics of uniform concurrency, in: Proc. 17th ACM STOC, Providence, R.I., 1985.","DOI":"10.1145\/22145.22174"},{"key":"5_CR11","unstructured":"M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley 1978."},{"key":"5_CR12","unstructured":"C.A.R. Hoare, A model for communicating sequential processes, in: \"On the Construction of Programs\" (R.M. McKeag and A.M. McNaughton, Eds.), 229\u2013243, Cambridge Univ. Press, London\/New York."},{"key":"5_CR13","unstructured":"J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley 1979."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"A.J. Korenjak, J.E. Hopcroft, Simple deterministic languages, Proc. of 7th Annual Symposium on Switching and Automata Theory, Berkeley, 36\u201346, 1966.","DOI":"10.1109\/SWAT.1966.22"},{"key":"5_CR15","volume-title":"Programming calculi based on fixed point transformations: semantics and applications","author":"J.-J. Ch Ch. Meyer","year":"1985","unstructured":"J.-J.Ch. Meyer, Programming calculi based on fixed point transformations: semantics and applications, Ph.D. Thesis, Free University, Amsterdam 1985."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"R. Milner, A calculus of communicating systems, Springer LNCS 92, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"5_CR17","doi-asserted-by":"publisher","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, J. Comput. and Syst. Sci. 28, 439\u2013466, 1984.","journal-title":"J. Comput. and Syst. Sci."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"D. Park, Concurrency and automata on infinite sequences, in: P. Deussen, Ed., Proc. 5th GI Conf. on Theor. Comp. Sci., Springer LNCS 104 (1981).","DOI":"10.1007\/BFb0017309"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"A. Salomaa, Computation and automata, Cambridge University Press 1985.","DOI":"10.1017\/CBO9781107325630"},{"key":"5_CR20","volume-title":"Formal languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa, Formal languages, Academic Press, N.Y., 1973."}],"container-title":["Lecture Notes in Computer Science","PARLE Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17945-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:43Z","timestamp":1605644023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17945-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540179450","9783540471813"],"references-count":20,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-17945-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1987]]}}}