{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T11:06:03Z","timestamp":1791111963849,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540513711","type":"print"},{"value":"9783540462019","type":"electronic"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035774","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T04:00:28Z","timestamp":1133409628000},"page":"423-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Structured operational semantics and bisimulation as a congruence"],"prefix":"10.1007","author":[{"given":"Jan Friso","family":"Groote","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"S. Abramsky (1987): Observation equivalence as a testing equivalence. Theoretical Computer Science 53, pp. 225\u2013241.","journal-title":"Theoretical Computer Science"},{"key":"27_CR2","unstructured":"J.C.M. Baeten & R.J. van Glabbeek (1987): Merge and termination in process algebra. In: Proceedings 7th Conference on Foundations of Software Technology & Theoretical Computer Science, Pune, India (K.V. Nori, ed.), LNCS 287, Springer-Verlag, pp. 153\u2013172."},{"key":"27_CR3","volume-title":"An algebra for process creation. Report CSR89..","author":"J.C.M. Baeten","year":"1989","unstructured":"J.C.M. Baeten & F.W. Vaandrager (1989): An algebra for process creation. Report CSR89.., Centrum voor Wiskunde en Informatica, Amsterdam, to appear."},{"key":"27_CR4","unstructured":"J.W. de Bakker & J.N. Kok (1988): Uniform abstraction, atomicity and contractions in the comparative semantics of concurrent Prolog. In: Proceedings Fifth Generation Computer Systems 1988 (FGCS'88), Tokyo, Japan."},{"key":"27_CR5","first-page":"21","volume-title":"A complete inference system for regular processes with silent moves","author":"J.A. Bergstra","year":"1988","unstructured":"J.A. Bergstra & J.W. Klop (1988): A complete inference system for regular processes with silent moves. In: Proceedings Logic Colloquium 1986 (F.R. Drake & J.K. Truss, eds.), North Holland, Hull, pp. 21\u201381, also appeared as: Report CS-R8420, Centrum voor Wiskunde en Informatica, Amsterdam 1984."},{"key":"27_CR6","unstructured":"B. Bloom (November 1988): Personal communication."},{"key":"27_CR7","unstructured":"B. Bloom, S. Istrail & A.R. Meyer (1988): Bisimulation can't be traced: preliminary report. In: Conference Record of the 15th ACM Symposium on Principles of Programming Languages (POPL), San Diego, California, pp. 229\u2013239."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek (1987): Bounded nondeterminism and the approximation induction principle in process algebra. In: Proceedings STACS 87 (F.J. Brandenburg, G. Vidal-Naquet & M. Wirsing, eds.), LNCS 247, Springer-Verlag, pp. 336\u2013347.","DOI":"10.1007\/BFb0039617"},{"key":"27_CR9","volume-title":"Structured operational semantics and bisimulation as a congruence. Report CS-R8845","author":"J.F. Groote","year":"1988","unstructured":"J.F. Groote & F.W. Vaandrager (1988): Structured operational semantics and bisimulation as a congruence. Report CS-R8845, Centrum voor Wiskunde en Informatica, Amsterdam."},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy & R. Milner (1985): Algebraic laws for nondeterminism and concurrency. JACM 32(1), pp. 137\u2013161.","journal-title":"JACM"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner (1980): A Calculus of Communicating Systems, LNCS 92, Springer-Verlag.","DOI":"10.1007\/3-540-10235-3"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner (1983): Calculi for synchrony and asynchrony. Theoretical Computer Science 25, pp. 267\u2013310.","journal-title":"Theoretical Computer Science"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"D.M.R. Park (1981): Concurrency and automata on infinite sequences. In: Proceedings 5th GI Conference (P. Deussen, ed.), LNCS 104, Springer-Verlag, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"27_CR14","unstructured":"G.D. Plotkin (1981): A Structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University."},{"key":"27_CR15","first-page":"199","volume-title":"An operational semantics for CSP","author":"G.D. Plotkin","year":"1983","unstructured":"G.D. Plotkin (1983): An operational semantics for CSP. In: Proceedings IFIP TC2 Working Conference on Formal Description of Programming Concepts \u2014 II, Garmish, 1982 (D. Bj\u00f8rner, ed.), North-Holland, Amsterdam, pp. 199\u2013225."},{"key":"27_CR16","unstructured":"R. de Simone (1984): Calculabilit\u00e9 et expressivit\u00e9 dans l'algebra de processus parall\u00e8les Meije. Th\u00e8se de 3e cycle, Univ. Paris 7."},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"R. de Simone (1985): Higher-level synchronising devices inMeije-SCCS, Theoretical Computer Science 37, pp. 245\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"27_CR18","unstructured":"J.L.M. Vrancken (1986): The algebra of communicating processes with empty process. Report FVI 86-01, Dept. of Computer Science, University of Amsterdam."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:24:05Z","timestamp":1578525845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035774"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0035774","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"29 November 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}