{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T17:28:33Z","timestamp":1656610113479},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540510802","type":"print"},{"value":"9783540461470","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0013021","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:06:46Z","timestamp":1132726006000},"page":"50-122","source":"Crossref","is-referenced-by-count":33,"title":["Process theory based on bisimulation semantics"],"prefix":"10.1007","author":[{"given":"J. A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"J. W.","family":"Klop","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"2_CR1","unstructured":"ACZEL, P. (87), Lecture Notes on Non-Well-Founded sets, CSLI, Lecture Notes Nr.9, 1987"},{"key":"2_CR2","first-page":"254","volume":"298","author":"P. America","year":"1988","unstructured":"AMERICA, P. & RUTTEN, J.J.M.M. (88), Solving reflexive domain equations in a category of complete metric spaces, in: Proc. of the Third Workshop on Mathematical Foundations of Programming Language Semantics (M. Main, A. Melton, M. Mislove, D. Schmidt, eds.), Springer LNCS 298, 1988, p.254\u2013288. Also to appear in the Journal of Computer and System Sciences.","journal-title":"Springer LNCS"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","volume":"78","author":"J.C.M. Baeten","year":"1988","unstructured":"BAETEN, J.C.M. & BERGSTRA, J.A. (88), Global renaming operators in concrete process algebra, Information and Computation, Vol.78, Nr.3 (1988), 205\u2013245.","journal-title":"Information and Computation"},{"issue":"2","key":"2_CR4","first-page":"127","volume":"IX","author":"J.C.M. Baeten","year":"1986","unstructured":"BAETEN, J.C.M., BERGSTRA, J.A. & KLOP, J.W. (86), Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inf. IX (2), p.127\u2013168, 1986.","journal-title":"Fund. Inf."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J.C.M. Baeten","year":"1987","unstructured":"BAETEN, J.C.M., BERGSTRA, J.A. & KLOP, J.W. (87) On the consistency of Koomen's Fair Abstraction Rule, TCS 51 (1987), 129\u2013176.","journal-title":"TCS"},{"key":"2_CR6","first-page":"94","volume":"259","author":"J.C.M. Baeten","year":"1987","unstructured":"BAETEN, J.C.M., BERGSTRA, J.A. & KLOP, J.W. (87a), Decidability of bisimulation equivalence for processes generating context-free languages, in: Proc. PARLE, Vol.II (Parallel Languages), (eds. J.W. de Bakker, A.J. Nijman, P.C. Treleaven), Eindhoven 1987, Springer LNCS 259, p.94\u2013113, 1987.","journal-title":"Springer LNCS"},{"key":"2_CR7","first-page":"53","volume-title":"Conditional axioms and \u03b1\/\u03b2 calculus in process algebra","author":"J.C.M. Baeten","year":"1987","unstructured":"BAETEN, J.C.M., BERGSTRA, J.A. & KLOP, J.W. (87b), Conditional axioms and \u03b1\/\u03b2 calculus in process algebra, in: Proc. IFIP Conf. on Formal Description of Programming Concepts\u2014III, Ebberup 1986, (M. Wirsing, ed.) North-Holland, Amsterdam 1987, p.53\u201375."},{"key":"2_CR8","first-page":"84","volume":"267","author":"J.C.M. Baeten","year":"1987","unstructured":"BAETEN, J.C.M. & VAN GLABBEEK, R.J. (87), Another look at abstraction in process algebra, in: Proc. 14th ICALP 87, Karlsruhe (Th. Ottman, ed.), Springer LNCS 267, p.84\u201394, 1987.","journal-title":"Springer LNCS"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(84)90114-2","volume":"34","author":"J.W. Bakker De","year":"1984","unstructured":"DE BAKKER, J.W., BERGSTRA, J.A., KLOP, J.W. & MEYER, J.-J.CH. (84), Linear time and branching time semantics for recursion with merge. Theoretical Computer Science 34 (1984), p.135\u2013156.","journal-title":"Theoretical Computer Science"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"DE BAKKER, J.W. & ZUCKER, J.I. (82a), Denotational semantics of concurrency, Proc. 14th ACM Symp. Theory of Comp., p. 153\u2013158, 1982.","DOI":"10.1145\/800070.802188"},{"issue":"1\/2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","volume":"54","author":"J.W. Bakker De","year":"1982","unstructured":"DE BAKKER, J.W. & ZUCKER, J.I. (82b), Processes and the denotational semantics of concurrency, Information and Control 54 (1\/2), p. 70\u2013120, 1982.","journal-title":"Information and Control"},{"issue":"1\/3","key":"2_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"BERGSTRA, J.A. & KLOP, J.W. (84a), Process algebra for synchronous communication, Information & Control 60 (1\/3), p. 109\u2013137, 1984.","journal-title":"Information & Control"},{"key":"2_CR13","first-page":"82","volume":"172","author":"J.A. Bergstra","year":"1984","unstructured":"BERGSTRA, J.A. & KLOP, J.W. (84b), The algebra of recurively defined processes and the algebra of regular processes, in: Proc. 11th ICALP (ed. J. Paredaens), Antwerpen 1984, Springer LNCS 172, p.82\u201395, 1984.","journal-title":"Springer LNCS"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"BERGSTRA, J.A. & KLOP, J.W. (85), Algebra of communicating processes with abstraction, TCS 37 (1), p. 77\u2013121, 1985.","journal-title":"TCS"},{"key":"2_CR15","first-page":"9","volume":"31","author":"J.A. Bergstra","year":"1986","unstructured":"BERGSTRA, J.A. & KLOP, J.W. (86a), Verification of an alternating bit protocol by means of process algebra, in: Math. Methods of Spec. and Synthesis of Software Systems '85 (eds. W. Bibel and K.P. Jantke), Math. Research 31, Akademie-Verlag Berlin, p.9\u201323. 1986.","journal-title":"Math. Research"},{"key":"2_CR16","first-page":"89","volume-title":"CWI Monographs I, Proceedings of the CWI Symposium Mathematics and Computer Science","author":"J.A. Bergstra","year":"1986","unstructured":"BERGSTRA, J.A. & KLOP, J.W. (86b), Algebra of communicating processes, in: CWI Monographs I, Proceedings of the CWI Symposium Mathematics and Computer Science (eds. J.W. de Bakker, M. Hazewinkel & J.K. Lenstra) North-Holland, Amsterdam, 1986, p.89\u2013138."},{"key":"2_CR17","first-page":"61","volume-title":"CWI Monograph 4, Proceedings of the CWI Symposium Mathematics and Computer Science II","author":"J.A. Bergstra","year":"1986","unstructured":"BERGSTRA, J.A. & KLOP, J.W. (86c), Process algebra: specification and verification in bisimulation semantics, in: CWI Monograph 4, Proceedings of the CWI Symposium Mathematics and Computer Science II (eds. M. Hazewinkel, J.K. Lenstra & L.G.L.T. Meertens), North-Holland, Amsterdam 1986, p.61\u201394."},{"key":"2_CR18","volume-title":"A convergence theorem in process algebra, CWI Report CS-R8733","author":"J.A. Bergstra","year":"1987","unstructured":"BERGSTRA, J.A. & KLOP, J.W. (87), A convergence theorem in process algebra, CWI Report CS-R8733, Centre for Mathematics and Computer Science, Amsterdam, 1987."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"BERGSTRA, J.A. & KLOP, J.W. (88), A complete inference system for regular processes with silent moves, in: Proc. of Logic Colloquium, Hull '86, (eds. F.R. Drake and J.K. Truss), North-Holland 1988.","DOI":"10.1016\/S0049-237X(09)70651-2"},{"key":"2_CR20","unstructured":"BERGSTRA, J.A., KLOP, J.W. & OLDEROG, E.-R. (86), Failure semantics with fair abstraction, CWI Report CS-R8609, Amsterdam 1986."},{"key":"2_CR21","first-page":"77","volume-title":"Proceedings IFIP Conference on Formal Description of Programming Concepts\u2014III, Gl. Avernaes (Ebberup) 1986","author":"J.A. Bergstra","year":"1987","unstructured":"BERGSTRA, J.A., KLOP, J.W. & OLDEROG, E.-R. (87), Failures without chaos: a new process semantics for fair abstraction, in: Proceedings IFIP Conference on Formal Description of Programming Concepts\u2014III, Gl. Avernaes (Ebberup) 1986 (ed. M. Wirsing), North-Holland, Amsterdam, p.77\u2013103, 1987."},{"key":"2_CR22","unstructured":"BERGSTRA, J.A., KLOP, J.W. & OLDEROG, E.-R. (88), Readies and failures in the algebra of communicating processes, CWI Report CS-R8523, Amsterdam 1985. To appear in SIAM J. of Computing, 1988."},{"key":"2_CR23","first-page":"213","volume":"X","author":"J.A. Bergstra","year":"1987","unstructured":"BERGSTRA, J.A. & TIURYN, J. (87), Process algebra semantics for queues, Fund. Inf. X, p.213\u2013224, 1987.","journal-title":"Fund. Inf."},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0167-6423(85)90010-3","volume":"5","author":"J.A. Bergstra","year":"1984","unstructured":"BERGSTRA, J.A. & TUCKER, J.V. (84), Top down design and the algebra of communicating processes, Sci. of Comp. Progr. 5 (2), p. 171\u2013199, 1984.","journal-title":"Sci. of Comp. Progr."},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"BROOKES, S.D. (83), On the relationship of CCS and CSP Proc. 10th ICALP (ed. J. D\u00edaz), Barcelona 1983, Springer LNCS 154, 83\u201396.","DOI":"10.1007\/BFb0036899"},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"BROOKES, S.D., HOARE, C.A.R. & ROSCOE, A.W. (84), A theory of Communicating Sequential Processes, JACM Vol.31, No.3 (1984) 560\u2013599.","journal-title":"JACM"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"DE NICOLA, R. & HENNESSY, M. (83), Testing equivalences for processes, TCS 34, p.83\u2013133.","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"VAN GLABBEEK, R.J. (87), Bounded nondeterminism and the approximation principle in process algebra. In: Proc. of the 4th Annual Symposium on Theoretical Aspects of Computer Science (eds. F.J. Brandenburg, G. Vidal-Naquet and M. Wirsing), Passau (W. Germany) 1987, Springer LNCS 247, 336\u2013347.","DOI":"10.1007\/BFb0039617"},{"key":"2_CR29","unstructured":"VAN GLABBEEK, R.J. & VAANDRAGER, F.W. (88), Modular specifications in process algebra\u2014with curious queues, Centre for Mathematics and Computer Science, Report CS-R8821, Amsterdam 1988; extended abstract to appear in: Proc. of the METEOR Workshop on Algebraic Methods: Theory, Tools and Applications, Springer LNCS."},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/S0019-9958(83)80039-4","volume":"57","author":"W.G. Golson","year":"1983","unstructured":"GOLSON, W.G. & ROUNDS, W.C. (83), Connections between two theories of concurrency: metric spaces and synchronization trees. Information and Control 57 (1983), 102\u2013124.","journal-title":"Information and Control"},{"key":"2_CR31","unstructured":"HENNESSY, M. (88), Algebraic theory of processes, The MIT Press, 1988."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"HENNESSY, M. & MILNER, R. (85), Algebraic laws for nondeterminism and nondeterminism and concurrency, JACM 32, 137\u2013161.","DOI":"10.1145\/2455.2460"},{"key":"2_CR33","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(88)90143-0","volume":"59","author":"W. Hesselink","year":"1988","unstructured":"HESSELINK, W. (88), Deadlock and fairness in morphisms of transition systems, Theor. Comp. Sci. 59 (1988) 235\u2013257.","journal-title":"Theor. Comp. Sci."},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"HOARE, C.A.R. (78), Communicating sequential processes, Comm. ACM 21, p. 666\u2013677, 1978.","journal-title":"Comm. ACM"},{"key":"2_CR35","unstructured":"HOARE, C.A.R. (84), Notes on communicating sequential processes, International Summer School in Marktoberdorf: Control Flow and Data Flow, Munich 1984."},{"key":"2_CR36","unstructured":"HOARE, C.A.R. (85), Communicating sequential processes, Prentice Hall 1985."},{"key":"2_CR37","unstructured":"KOYMANS, C.P.J. & MULDER, J.C. (86), A modular approach to protocol verification using process algebra, Logic Group Preprint Series Nr.6, Dept. of Philosophy, State University of Utrecht, 1986; to appear in: Applications of Process Algebra, (J.C.M. Baeten, ed.), CWI Monograph, North-Holland, 1988."},{"key":"2_CR38","unstructured":"KOYMANS, C.P.J. & VRANCKEN, J.L.M. (85), Extending process algebra with the empty process \u025b, Logic Group Preprint Series Nr.1, Dept. of Philosophy, State University of Utrecht, 1985."},{"key":"2_CR39","unstructured":"KOSSEN, L. & WEIJLAND, W.P. (87), Correctness proofs for systolic algorithms: palindromes and sorting, Report FVI 87-04, Computer Science Department, University of Amsterdam, 1987."},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"KRANAKIS, E. (86), Approximating the projective model, in: Proc. Conf. on Math. Logic & its Applications, Druzhba (Bulgaria), 1986 (Pergamon Press).","DOI":"10.1007\/978-1-4613-0897-3_19"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"KRANAKIS, E. (87), Fixed point equations with parameters in the projective model, Information and Computation, Vol.75, No.3, 1987.","DOI":"10.1016\/0890-5401(87)90003-4"},{"key":"2_CR42","unstructured":"MAUW, S. (87), A constructive version of the Approximation Induction Principle, Report FVI 87-09, Computer Science Department, University of Amsterdam, 1987."},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"MILNER, R. (80), A calculus of communicating systems, Springer LNCS 92, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"2_CR44","unstructured":"MILNER, R. (84a), Lectures on a Calculus for Communicating Systems, Working Material for the Summer School Control Flow and Data Flow, Munich, July 1984."},{"issue":"3","key":"2_CR45","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"MILNER, R. (84b), A complete inference system for a class of regular behaviours, Journal of Computer and System Sciences, Vol.28, Nr.3, 439\u2013466, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR46","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-15670-4_10","volume":"197","author":"R. Milner","year":"1985","unstructured":"MILNER, R. (85), Lectures on a calculus for communicating systems, in: Seminar on Concurrency, Springer LNCS 197 (1985), 197\u2013220.","journal-title":"Seminar on Concurrency, Springer LNCS"},{"key":"2_CR47","unstructured":"MILNER, R. (88), A complete axiomatisation for observational congruence of finite-state behaviours, Preprint, Univ. of Edinburgh 1985; to appear in Information and Computation 1988."},{"key":"2_CR48","unstructured":"MOLLER, F. (88), Non-finite axiomatisability in Process Algebras, preprint, Univ. of Edinburgh, 1988"},{"key":"2_CR49","volume-title":"On the Amoeba protocol, CWI Report CS-R8827","author":"J.C. Mulder","year":"1988","unstructured":"MULDER, J.C. (88), On the Amoeba protocol, CWI Report CS-R8827, Centre for Mathematics and Computer Science, Amsterdam 1988."},{"key":"2_CR50","unstructured":"PARK, D.M.R. (81), Concurrency and automata on infinite sequences. Proc. 5th GI Conference, Springer LNCS 104, 1981."},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"PHILLIPS, I.C.C. (87), Refusal testing, TCS 50 (2), 1987.","DOI":"10.1016\/0304-3975(87)90117-4"},{"key":"2_CR52","series-title":"CWI Report","volume-title":"Verification of two communication protocols by means of process algebra","author":"F.W. Vaandrager","year":"1986","unstructured":"VAANDRAGER, F.W. (86), Verification of two communication protocols by means of process algebra, CWI Report CS-R8608, Centre for Mathematics and Computer Science, Amsterdam 1986."},{"key":"2_CR53","unstructured":"VRANCKEN, J.L.M. (86), The Algebra of Communicating Processes with empty process, Report FVI 86-01, Computer Science Department, University of Amsterdam, 1986."},{"key":"2_CR54","unstructured":"WEIJLAND, W.P. (87), A systolic algorithm for matrix-vector multiplication, Report FVI 87-08, Computer Science Department, University of Amsterdam, 1987; also in: Proc. SION Conf. CSN 87, p.143\u2013160, CWI, Amsterdam 1987."}],"container-title":["Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:24:07Z","timestamp":1586579047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510802","9783540461470"],"references-count":54,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0013021","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1989]]}}}