{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:12Z","timestamp":1725460032146},"publisher-location":"Berlin\/Heidelberg","reference-count":23,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540582770"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0049323","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T18:58:16Z","timestamp":1141671496000},"page":"36-65","source":"Crossref","is-referenced-by-count":1,"title":["Process algebra with combinators"],"prefix":"10.1007","author":[{"given":"Jan A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"Inge","family":"Bethke","sequence":"additional","affiliation":[]},{"given":"Alban","family":"Ponse","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"T. Bolognesi and E. Brinksma. Introduction to the ISO Specification Language LOTOS. Computer Networks and ISDN Systems,14:25\u201329. Elsevier Science Publishers, 1987.","key":"4_CR1","DOI":"10.1016\/0169-7552(87)90085-7"},{"issue":"3","key":"4_CR2","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":"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"},{"unstructured":"J. A. Bergstra, I. Bethke and A. Ponse. Process algebra with nesting and iteration. Report P9314a (revised version of Report P9314), Programming Research Group, University of Amsterdam, 1994. To appear in The Computer Journal.","key":"4_CR3"},{"unstructured":"M. Bezem and J. F. Groote. A formal verification of the Alternating Bit Protocol in the Calculus of Constructions. Logic Group Preprint Series, no. 88, Department of Philosophy, University of Utrecht, 1993.","key":"4_CR4"},{"issue":"1\/3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60(1\/3):109\u2013137, 1984.","journal-title":"Information and Control"},{"issue":"1","key":"4_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77\u2013121, 1985.","journal-title":"Theoretical Computer Science"},{"key":"4_CR7","first-page":"9","volume-title":"Math. Methods of Spec. and Synthesis of Software Systems '85, Math, Research 31","author":"J.A. Bergstra","year":"1986","unstructured":"J.A. Bergstra and J.W. Klop. Verification of an alternating bit protocol by means of process algebra. In W. Bibel and K.P. Jantke, editors, Math. Methods of Spec. and Synthesis of Software Systems '85, Math, Research 31, pages 9\u201323, Berlin, 1986. Akademie-Verlag."},{"key":"4_CR8","first-page":"77","volume-title":"Formal Description of Programming Concepts \u2014 III, Proceedings of the 3th IFIP WG 2.2 working conference, Ebberup 1986","author":"J.A. Bergstra","year":"1987","unstructured":"J.A. Bergstra, J.W. Klop, and E.-R. Olderog. Failures without chaos: a new process semantics for fair abstraction. In M. Wirsing, editor, Formal Description of Programming Concepts \u2014 III, Proceedings of the 3 th IFIP WG 2.2 working conference, Ebberup 1986, pages 77\u2013103, Amsterdam, 1987. North-Holland."},{"issue":"2","key":"4_CR9","first-page":"171","volume":"5","author":"J.A. Bergstra","year":"1984","unstructured":"J.A. Bergstra and J.V. Tucker. Top down design and the algebra of communicating processes. Science of Computer Programming, 5(2):171\u2013199, 1984.","journal-title":"Science of Computer Programming"},{"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.","key":"4_CR10","DOI":"10.1017\/CBO9780511624193"},{"unstructured":"J.C.M. Baeten (ed.). Applications of Process Algebra. Cambridge Tracts in Theoretical Computer Science 17. Cambridge University Press, 1990.","key":"4_CR11"},{"unstructured":"E. Brinksma. On the design of extended LOTOS \u2014 a specification language for open distributed systems. Ph.D. thesis, University of Twente, 1988.","key":"4_CR12"},{"key":"4_CR13","volume-title":"Combinatory Logic. Volume I","author":"H. B. Curry","year":"1958","unstructured":"H. B. Curry and R. Feys. Combinatory Logic. Volume I. North-Holland, Amsterdam, 1958."},{"key":"4_CR14","series-title":"Technical Report CS-R9076","volume-title":"The syntax and semantics of \u03bcCRL","author":"J. F. Groote","year":"1990","unstructured":"J. F. Groote and A. Ponse. The syntax and semantics of \u03bcCRL. Technical Report CS-R9076, CWI, Amsterdam, 1990."},{"doi-asserted-by":"crossref","unstructured":"J. F. Groote and A. Ponse. Proof theory for \u03bcCRL: a language for processes with data. In D.J. Andrews, J.F. Groote and C.A. Middelburg, editors, Proceedings of the International Workshop on Semantics of Specification Languages. Workshops in Computer Science, Springer Verlag, 1994.","key":"4_CR15","DOI":"10.1007\/978-1-4471-3229-5_13"},{"issue":"2","key":"4_CR16","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/0304-3975(93)90006-F","volume":"113","author":"R.J. Glabbeek van","year":"1993","unstructured":"R.J. van Glabbeek and F.W. Vaandrager. Modular specifications in Process Algebra. Theoretical Computer Science, 113(2):294\u2013348, 1993.","journal-title":"Theoretical Computer Science"},{"key":"4_CR17","volume-title":"Introduction to combinators and \u03bb-calculus","author":"J. R. Hindley","year":"1986","unstructured":"J. R. Hindley and J. P. Seldin. Introduction to combinators and \u03bb-calculus. London Mathematical Society Student Texts.1, Cambridge University Press, Cambridge, 1986."},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/FI-1990-13202","volume":"XIII","author":"S. Mauw","year":"1990","unstructured":"S. Mauw and G. J. Veltink. A process specification formalism. Fundamenta Informaticae, XIII:85\u2013139, 1990.","journal-title":"Fundamenta Informaticae"},{"unstructured":"S. Mauw. A process specification formalism. Ph.D. thesis, University of Amsterdam, 1991.","key":"4_CR19"},{"unstructured":"J. Parrow. Fairness properties in process algebra \u2014 with applications in communication protocol verification. Ph.D. thesis, Dept. of Comp. Sci., Uppsala Univ., 1985.","key":"4_CR20"},{"issue":"3","key":"4_CR21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1305\/ndjfl\/1093956080","volume":"VIII","author":"L. E. Sanchis","year":"1967","unstructured":"L. E. Sanchis. Functionals defined by recursion. Notre Dame Journal of Formal Logic, VIII(3):161\u2013174, 1967.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01448013","volume":"92","author":"M. Sch\u00f6nfinkel","year":"1924","unstructured":"M. Sch\u00f6nfinkel. \u00dcber die Bausteine der mathematischen Logik. Mathematische Annalen, 92:305\u2013316, 1924.","journal-title":"Mathematische Annalen"},{"doi-asserted-by":"crossref","unstructured":"F. W. Vaandrager. Two simple protocols. In J. C. M. Baeten, editor, Applications of Process Algebra, pages 23\u201344, Cambridge Tracts in Theoretical Computer Science 17, Cambridge University Press, 1990.","key":"4_CR23","DOI":"10.1017\/CBO9780511608841.003"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0049323.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T15:47:03Z","timestamp":1627141623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0049323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540582770"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0049323","relation":{},"subject":[]}}