{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:43Z","timestamp":1725457003313},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540516989"},{"type":"electronic","value":"9783540467588"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0015049","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:08:54Z","timestamp":1134281334000},"page":"465-506","source":"Crossref","is-referenced-by-count":10,"title":["Modular specifications in process algebra"],"prefix":"10.1007","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,23]]},"reference":[{"key":"17_CR1","series-title":"ESPRIT project 415, Doc. Nr.","volume-title":"Definition of the programming language POOL-T","author":"P. America","year":"1985","unstructured":"P. America (1985): Definition of the programming language POOL-T. ESPRIT project 415, Doc. Nr. 91, Philips Research Laboratories, Eindhoven."},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(84)90067-7","volume":"30","author":"D. Austry","year":"1984","unstructured":"D. Austry & G. Boudol (1984): Alg\u00e8bre de processus et synchronisations. Theoretical Computer Science 30(1), pp. 91\u2013131.","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","unstructured":"J.C.M. Baeten & J.A. Bergstra (1987): Global Renaming Operators in Concrete Process Algebra (revised version). Report P8709, Programming Research Group, University of Amsterdam, to appear in I&C."},{"key":"17_CR4","first-page":"53","volume-title":"Formal Description of Programming Concepts \u2014 III, Proceedings of the third IFIP WG 2.2 working conference, Ebberup 1986","author":"J.C.M. Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra & J.W. Klop (1987): Conditional Axioms and \u03b1\/\u03b2 Calculus in Process Algebra. In: Formal Description of Programming Concepts \u2014 III, Proceedings of the third IFIP WG 2.2 working conference, Ebberup 1986 (M. Wirsing, ed.), North-Holland, Amsterdam, pp. 53\u201375."},{"issue":"1\/2","key":"17_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":"J.C.M. Baeten, J.A. Bergstra & J.W. Klop (1987): On the Consistency of Koomen's Fair Abstraction Rule. Theoretical Computer Science 51(1\/2), pp. 129\u2013176.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"17_CR6","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","volume":"30","author":"J.C.M. Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra & J.W. Klop (1987): Ready trace semantics for concrete process algebra with priority operator. The Computer Journal 30(6), pp. 498\u2013506.","journal-title":"The Computer Journal"},{"key":"17_CR7","doi-asserted-by":"crossref","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.","DOI":"10.1007\/3-540-18625-5_49"},{"key":"17_CR8","unstructured":"J.A. Bergstra (1985): A Process Creation Mechanism in Process Algebra. Logic Group Preprint Series Nr. 2, CIF, State University of Utrecht, to appear in: Applications of Process Algebra, (J.C.M. Baeten, ed.), CWI Monograph, North-Holland, 1988."},{"key":"17_CR9","volume-title":"Module Algebra. Report CS-R8617","author":"J.A. Bergstra","year":"1986","unstructured":"J.A. Bergstra, J. Heering & P. Klint (1986): Module Algebra. Report CS-R8617, Centrum voor Wiskunde en Informatica, Amsterdam, to appear in: Journal of the ACM."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra & J.W. Klop (1984): The algebra of recursively defined processes and the algebra of regular processes. In: Proceedings 11th ICALP, Antwerpen (J. Paredaens, ed.), LNCS 172, Springer-Verlag, pp. 82\u201395.","DOI":"10.1007\/3-540-13345-3_7"},{"issue":"1\/3","key":"17_CR11","first-page":"109","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"J.A. Bergstra & J.W. Klop (1984): Process algebra for synchronous communication. I&C 60(1\/3), pp. 109\u2013137.","journal-title":"I&C"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"J.A. Bergstra & J.W. Klop (1985): Algebra of communicating processes with abstraction. Theoretical Computer Science 37(1), pp. 77\u2013121.","journal-title":"Theoretical Computer Science"},{"key":"17_CR13","series-title":"CWI Monograph","first-page":"61","volume-title":"Mathematics and Computer Science II","author":"J.A. Bergstra","year":"1986","unstructured":"J.A. Bergstra & J.W. Klop (1986): Process Algebra: Specification and Verification in Bisimulation Semantics. In: Mathematics and Computer Science II, CWI Monograph 4 (M. Hazewinkel, J.K. Lenstra & L.G.L.T. Meertens, eds.), North-Holland, Amsterdam, pp. 61\u201394."},{"key":"17_CR14","unstructured":"J.A. Bergstra & J.W. Klop: ACP\u03c4: A Universal Axiom System for Process Specification. This volume."},{"key":"17_CR15","first-page":"77","volume-title":"Formal Description of Programming Concepts \u2014 III, Proceedings of the third IFIP WG 2.2 working conference, Ebberup 1986","author":"J.A. Bergstra","year":"1987","unstructured":"J.A. Bergstra, J.W. Klop & E.-R. Olderog (1987): Failures without chaos: a new process semantics for fair abstraction. In: Formal Description of Programming Concepts \u2014 III, Proceedings of the third IFIP WG 2.2 working conference, Ebberup 1986 (M. Wirsing, ed.), North-Holland, Amsterdam, pp. 77\u2013103."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra & J. Tiuryn (1987): Process Algebra Semantics for Queues. Fund. Inf. X, pp. 213\u2013224, also appeared as: MC Report IW 241, Amsterdam 1983.","DOI":"10.3233\/FI-1987-10207"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"S.D. Brookes & A.W. Roscoe (1985): An improved failures model for communicating processes. In: Seminar on Concurrency (S.D. Brookes, A.W. Roscoe & G. Winskel, eds.), LNCS 197, Springer-Verlag, pp. 281\u2013305.","DOI":"10.1007\/3-540-15670-4_14"},{"key":"17_CR18","unstructured":"M. Broy (1987): Views of Queues. Report MIP-8704, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau."},{"key":"17_CR19","unstructured":"CHILL (1980): Recommendation Z.200 (CHILL Language Definition). CCITT Study Group XI."},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"R. De Nicola & M. Hennessy (1984): Testing equivalences for processes. Theoretical Computer Science 34, pp. 83\u2013134.","journal-title":"Theoretical Computer Science"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"T. Denvir, W. Harwood, M. Jackson & M. Ray (1985): The Analysis of Concurrent Systems, Proceedings of a Tutorial and Workshop, Cambridge University 1983, LNCS 207, Springer-Verlag.","DOI":"10.1007\/3-540-16047-7"},{"key":"17_CR22","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":"17_CR23","volume-title":"Modular Specifications in Process Algebra \u2014 With Curious Queues. Report CS-R8821","author":"R.J. Glabbeek van","year":"1988","unstructured":"R.J. van Glabbeek & F.W. Vaandrager (1988): Modular Specifications in Process Algebra \u2014 With Curious Queues. Report CS-R8821, Centrum voor Wiskunde en Informatica, Amsterdam."},{"key":"17_CR24","unstructured":"C.A.R. Hoare (1980): Communicating sequential processes. In: On the construction of programs \u2014 an advanced course (R.M. McKeag & A.M. Macnaghten, eds.), Cambridge University Press, pp. 229\u2013254."},{"key":"17_CR25","unstructured":"C.A.R. Hoare (1985): Communicating Sequential Processes, Prentice-Hall International."},{"issue":"1","key":"17_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01786251","volume":"2","author":"H. Jifeng","year":"1987","unstructured":"He Jifeng & C.A.R. Hoare (1987): Algebraic specification and proof of a distributed recovery algorithm. Distributed Computing 2(1), pp. 1\u201312.","journal-title":"Distributed Computing"},{"key":"17_CR27","unstructured":"C.P.J. Koymans & J.C. Mulder (1986): A Modular Approach to Protocol Verification using Process Algebra. Logic Group Preprint Series Nr. 6, CIF, State University of Utrecht, to appear in: Applications of Process Algebra, (J.C.M. Baeten, ed.), CWI Monograph, North-Holland, 1988."},{"key":"17_CR28","first-page":"126","volume":"267","author":"K.G. Larsen","year":"1987","unstructured":"K.G. Larsen & R. Milner (1987): A Complete Protocol Verification Using Relativized Bisimulation. In: Proceedings 14th ICALP, Karlsruhe (Th. Ottmann, ed.), LNCS 267, Springer-Verlag, pp. 126\u2013135.","journal-title":"LNCS"},{"key":"17_CR29","unstructured":"S. Mauw (1987): An algebraic specification of process algebra, including two examples. This volume."},{"key":"17_CR30","unstructured":"S. Mauw & G.J. Veltink (1988): A Process Specification Formalism. Report P8814, Programming Research Group, University of Amsterdam."},{"key":"17_CR31","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":"17_CR32","first-page":"197","volume":"197","author":"R. Milner","year":"1985","unstructured":"R. Milner (1985): Lectures on a Calculus for Communicating Systems. In: Seminar on Concurrency (S.D. Brookes, A.W. Roscoe & G. Winskel, eds.), LNCS 197, Springer-Verlag, pp. 197\u2013220.","journal-title":"LNCS"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"J.D. Monk (1976): Mathematical Logic, Springer-Verlag.","DOI":"10.1007\/978-1-4684-9452-5"},{"key":"17_CR34","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.-R. Olderog","year":"1986","unstructured":"E.-R. Olderog & C.A.R. Hoare (1986): Specification-Oriented Semantics for Communicating Processes. Acta Informatica 23, pp. 9\u201366.","journal-title":"Acta Informatica"},{"key":"17_CR35","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","volume":"50","author":"I.C.C. Phillips","year":"1987","unstructured":"I.C.C. Phillips (1987): Refusal Testing. Theoretical Computer Science 50, pp. 241\u2013284.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"17_CR36","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V.R. Pratt","year":"1986","unstructured":"V.R. Pratt (1986): Modelling Concurrency with Partial Orders. International Journal of Parallel Programming 15(1), pp. 33\u201371.","journal-title":"International Journal of Parallel Programming"},{"key":"17_CR37","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00283329","volume":"25","author":"D.T. Sannella","year":"1988","unstructured":"D.T. Sannella & A. Tarlecki (1988): Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited. Acta Informatica 25, pp. 233\u2013281.","journal-title":"Acta Informatica"},{"key":"17_CR38","first-page":"413","volume":"158","author":"D.T. Sannella","year":"1983","unstructured":"D.T. Sannella & M. Wirsing (1983): A kernel language for algebraic specification and implementation (extended abstract). In: Proc. Intl. Conf. on Foundations of Computation Theory, Borgholm (M. Karpinski, ed.), LNCS 158, pp. 413\u2013427, long version: Report CSR-131-83, Dept. of Computer Science, Univ. of Edinburgh, 1983.","journal-title":"LNCS"},{"key":"17_CR39","unstructured":"F.W. Vaandrager (1986): Verification of Two Communication Protocols by Means of Process Algebra. Report CS-R8608, Centrum voor Wiskunde en Informatica, Amsterdam."},{"key":"17_CR40","unstructured":"F.W. Vaandrager (1986): Process algebra semantics of POOL. Report CS-R8629, Centrum voor Wiskunde en Informatica, Amsterdam, to appear in: Applications of Process Algebra, (J.C.M. Baeten, ed.), CWI Monograph, North-Holland, 1988."},{"key":"17_CR41","unstructured":"F.W. Vaandrager (1988): Some Observations on Redundancy in a Context. Report CSR8812, Centrum voor Wiskunde en Informatica, Amsterdam, to appear in: Applications of Process Algebra, (J.C.M. Baeten, ed.), CWI Monograph, North-Holland, 1988."}],"container-title":["Lecture Notes in Computer Science","Algebraic Methods: Theory, Tools and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T21:20:16Z","timestamp":1683321616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540516989","9783540467588"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/bfb0015049","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}