{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:39Z","timestamp":1762458999116},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565963"},{"type":"electronic","value":"9783540475958"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56596-5_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:18:32Z","timestamp":1330237112000},"page":"609-638","source":"Crossref","is-referenced-by-count":16,"title":["Expressiveness results for process algebras"],"prefix":"10.1007","author":[{"given":"Frits W.","family":"Vaandrager","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"24_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. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225\u2013241, 1987.","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","first-page":"113","volume-title":"Turning SOS rules into equations","author":"L. Aceto","year":"1992","unstructured":"L. Aceto, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. In Proceedings 7th Annual Symposium on Logic in Computer Science, Santa Cruz, California, pages 113\u2013124. IEEE Computer Society Press, 1992. Full version available as CWI Report CS-R9218, June 1992, Amsterdam. Invited to the LICS 92 Special Issue of Information and Computation."},{"issue":"4","key":"24_CR3","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1145\/6490.6494","volume":"33","author":"K.R. Apt","year":"1986","unstructured":"K.R. Apt and G.D. Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33(4):724\u2013767, October 1986.","journal-title":"Journal of the ACM"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BFb0084799","volume-title":"Proceedings CONCUR 92","author":"E. Badouel","year":"1992","unstructured":"E. Badouel and P. Darondeau. Structural operational specifications and trace automata. In W.R. Cleaveland, editor, Proceedings CONCUR 92, Stony Brook, NY, USA, volume 630 of Lecture Notes in Computer Science, pages 302\u2013316. Springer-Verlag, 1992."},{"issue":"3","key":"24_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","volume":"78","author":"J.C.M. Baeten","year":"1988","unstructured":"J.C.M. Baeten and J.A. Bergstra. Global renaming operators in concrete process algebra. Information and Computation, 78(3):205\u2013245, 1988.","journal-title":"Information and Computation"},{"issue":"1\/2","key":"24_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J.C.M. Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. On the consistency of Koomen's fair abstraction rule. Theoretical Computer Science, 51(1\/2):129\u2013176, 1987.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"24_CR7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01178776","volume":"29","author":"J.C.M. Baeten","year":"1992","unstructured":"J.C.M. Baeten and F.W. Vaandrager. An algebra for process creation. Acta Informatica, 29(4):303\u2013334, 1992.","journal-title":"Acta Informatica"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"24_CR9","unstructured":"G. Berry and G. Gonthier. The synchronous programming language Esterel: design, semantics, implementation. Report 842, INRIA, Centre Sophia-Antipolis, Valbonne Cedex, 1988. To appear in Science of Computer Programming."},{"key":"24_CR10","unstructured":"B. Bloom. Ready Simulation, Bisimulation, and the Semantics of CCS-like Languages. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, August 1989."},{"key":"24_CR11","unstructured":"B. Bloom. Strong process equivalence in the presence of hidden moves. Preliminary report, October 1990."},{"key":"24_CR12","series-title":"Full version available as Technical Report 90-1150","first-page":"229","volume-title":"Conference Record of the 15thACM Symposium on Principles of Programming Languages, San Diego, California","author":"B. Bloom","year":"1990","unstructured":"B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced: Preliminary report. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages, San Diego, California, pages 229\u2013239, 1988. Full version available as Technical Report 90-1150, Department of Computer Science, Cornell University, Ithaca, New York, August 1990. Accepted to appear in Journal of the ACM."},{"key":"24_CR13","series-title":"Full version available as Report CSR 9054","first-page":"481","volume-title":"Proceedings 18 th ICALP, Madrid, volume 510 of Lecture Notes in Computer Science","author":"R.N. Bol","year":"1990","unstructured":"R.N. Bol and J.F. Groote. The meaning of negative premises in transition system specifications (extended abstract). In J. Leach Albert, B. Monien, and M. Rodr\u00edguez, editors, Proceedings 18 th ICALP, Madrid, volume 510 of Lecture Notes in Computer Science, pages 481\u2013494. Springer-Verlag, 1991. Full version available as Report CSR 9054, CWI, Amsterdam, 1990."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"G. Boudol. Notes on algebraic calculi of processes. In K. Apt, editor, Logics and Models of Concurrent Systems, pages 261\u2013303. Springer-Verlag, 1985. NATO ASI Series F13.","DOI":"10.1007\/978-3-642-82453-1_9"},{"key":"24_CR15","first-page":"223","volume-title":"Volume 469 of Lecture Notes in Computer Science","author":"P. Darondeau","year":"1990","unstructured":"P. Darondeau. Concurrency and computability. In I. Guessarian, editor, Semantics of Systems of Concurrent Processes, Proceedings LITP Spring School on Theoretical Computer Science, La Roche Posay, France, Volume 469 of Lecture Notes in Computer Science, pages 223\u2013238. Springer-Verlag, 1990."},{"issue":"1","key":"24_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"24_CR17","first-page":"267","volume-title":"Volume 430 of Lecture Notes in Computer Science","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek and U. Goltz. Refinement of actions in causality based models. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands 1989, Volume 430 of Lecture Notes in Computer Science, pages 267\u2013300. Springer-Verlag, 1990."},{"key":"24_CR18","series-title":"LNCS 458","first-page":"332","volume-title":"Proceedings CONCUR 90","author":"J.F. Groote","year":"1990","unstructured":"J.F. Groote. Transition system specifications with negative premises. Report CSR8950, CWI, Amsterdam, 1989. An extended abstract appeared in J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, LNCS 458, pages 332\u2013341. Springer-Verlag, 1990."},{"issue":"2","key":"24_CR19","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202\u2013260, October 1992.","journal-title":"Information and Computation"},{"key":"24_CR20","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, Massachusetts, 1988."},{"key":"24_CR21","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, 1985."},{"key":"24_CR22","series-title":"An extended version appeared as: Report R89-13","first-page":"526","volume-title":"Proceedings 17thICALP, Warwick, volume 443 of Lecture Notes in Computer Science","author":"K.G. Larsen","year":"1989","unstructured":"K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. In M. Paterson, editor, Proceedings 17th ICALP, Warwick, volume 443 of Lecture Notes in Computer Science, pages 526\u2013539. Springer-Verlag, July 1990. An extended version appeared as: Report R89-13, The University of Aalborg, Dept. of Mathematics and Computer Science, Aalborg, Denmark, May 1989."},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 137\u2013151, August 1987. A full version is available as MIT Technical Report MIT\/LCS\/TR-387.","DOI":"10.1145\/41840.41852"},{"key":"24_CR24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"key":"24_CR25","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cliffs, 1989."},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167\u2013183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"24_CR27","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0167-739X(90)90024-8","volume":"6","author":"J. Parrow","year":"1990","unstructured":"J. Parrow. The expressive power of parallelism. Future Generation Computer Systems, 6:271\u2013285, 1990.","journal-title":"Future Generation Computer Systems"},{"key":"24_CR28","unstructured":"G.D. Plotkin. A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"24_CR29","first-page":"199","volume-title":"Proceedings IFIP TC2 Working Conference on Formal Description of Programming Concepts \u2014 II, Garmisch","author":"G.D. Plotkin","year":"1983","unstructured":"G.D. Plotkin. An operational semantics for CSP. In D. Bj\u00f8rner, editor, Proceedings IFIP TC2 Working Conference on Formal Description of Programming Concepts \u2014 II, Garmisch, pages 199\u2013225, Amsterdam, 1983. North-Holland."},{"key":"24_CR30","unstructured":"A. Ponse. Computable processes and bisimulation equivalence. Report CS-R9207, CWI, Amsterdam, January 1992. To appear in Information and Computation."},{"key":"24_CR31","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Co., 1967."},{"key":"24_CR32","first-page":"155","volume-title":"Proceedings IFIP Working Conference on Programming Concepts and Methods","author":"J.J.M.M. Rutten","year":"1990","unstructured":"J.J.M.M. Rutten. Deriving denotational models for bisimulation from structured operational semantics. In M. Broy and C.B. Jones, editors, Proceedings IFIP Working Conference on Programming Concepts and Methods, Sea of Gallilea, Israel, pages 155\u2013177. North-Holland, 1990."},{"key":"24_CR33","unstructured":"R. de Simone. Calculabilit\u00e9 et Expressivit\u00e9 dans l'Algebra de Processus Parall\u00e8les Meije. Th\u00e8se de 3e cycle, Univ. Paris 7, 1984."},{"key":"24_CR34","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","volume":"37","author":"R. Simone de","year":"1985","unstructured":"R. de Simone. Higher-level synchronising devices in Meije-SCCS. Theoretical Computer Science, 37:245\u2013267, 1985.","journal-title":"Theoretical Computer Science"},{"key":"24_CR35","first-page":"387","volume-title":"Proceedings 6th Annual Symposium on Logic in Computer Science","author":"F.W. Vaandrager","year":"1991","unstructured":"F.W. Vaandrager. On the relationship between process algebra and input\/output automata (extended abstract). In Proceedings 6 th Annual Symposium on Logic in Computer Science, Amsterdam, pages 387\u2013398. IEEE Computer Society Press, 1991."}],"container-title":["Lecture Notes in Computer Science","Semantics: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56596-5_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:43Z","timestamp":1605629083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56596-5_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565963","9783540475958"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-56596-5_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}