{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T07:25:17Z","timestamp":1746516317658},"reference-count":76,"publisher":"Elsevier","isbn-type":[{"value":"9780444828309","type":"print"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1016\/b978-044482830-9\/50023-0","type":"book-chapter","created":{"date-parts":[[2007,10,10]],"date-time":"2007-10-10T17:58:36Z","timestamp":1192039116000},"page":"333-389","source":"Crossref","is-referenced-by-count":15,"title":["Process Algebra with Recursive Operations"],"prefix":"10.1016","author":[{"given":"Jan A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[]},{"given":"Alban","family":"Ponse","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/B978-044482830-9\/50023-0_bib1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/inco.1997.2645","article-title":"An equational axiomatization for multi-exit iteration","volume":"137","author":"Aceto","year":"1997","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.1016\/B978-044482830-9\/50023-0_bib2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/inco.1996.0047","article-title":"Axiomatizing prefix iteration with silent steps","volume":"127","author":"Aceto","year":"1996","journal-title":"Inform. and Comput."},{"issue":"1\/2","key":"10.1016\/B978-044482830-9\/50023-0_bib3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0304-3975(97)00104-7","article-title":"On a question of A. Salomaa: The equational theory of regular expressions over a singleton alphabet is not finitely based","volume":"209","author":"Aceto","year":"1998","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/B978-044482830-9\/50023-0_bib4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1017\/S0960129597002491","article-title":"A menagerie of non-finitely based process semantics over BPA*: From ready simulation to completed traces","volume":"8","author":"Aceto","year":"1998","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib5","series-title":"Proceedings 1st Conference on Foundations of Software Science and Computation Structures (FoSSaCS'98)","first-page":"20","article-title":"A Cook's tour of equational axiomatizations for prefix iteration","author":"Aceto","year":"1998"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib6","series-title":"Handbook of Process Algebra","first-page":"197","article-title":"Structural operational semantics","author":"Aceto","year":"2001"},{"issue":"1\/2","key":"10.1016\/B978-044482830-9\/50023-0_bib7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0304-3975(97)00182-5","article-title":"A complete equational axiomatization for MPA with string iteration","volume":"211","author":"Aceto","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib8","series-title":"Proceedings 5th Conference on Algebraic Methodology and Software Technology (AMAST'96)","first-page":"195","article-title":"An equational axiomatization of observation congruence for prefix iteration","author":"Aceto","year":"1996"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib9","first-page":"1","article-title":"Delayed logic and finite state machines","author":"Arden","year":"1960"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib10","series-title":"Term Rewriting and All That","author":"Baader","year":"1998"},{"issue":"1\/2","key":"10.1016\/B978-044482830-9\/50023-0_bib11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","article-title":"On the consistency of Koomen's fair abstraction rule","volume":"51","author":"Baeten","year":"1987","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/B978-044482830-9\/50023-0_bib12","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","article-title":"Decidability of bisimulation equivalence for processes generating context-free languages","volume":"40","author":"Baeten","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib13","series-title":"Proceedings 14th Colloquium on Automata, Languages and Programming (ICALP'87)","first-page":"84","article-title":"Another look at abstraction in process algebra","author":"Baeten","year":"1987"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib14","series-title":"Proceedings 4th Conference on Concurrency Theory (CONCUR'93)","first-page":"477","article-title":"A congruence theorem for structured operational semantics with predicates","author":"Baeten","year":"1993"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib15","article-title":"Process Algebra","volume":"18","author":"Baeten","year":"1990"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib16","article-title":"Process algebra with iteration","author":"Bergstra","year":"1993","journal-title":"Report P9314, Programming Research Group, University of Amsterdam"},{"issue":"4","key":"10.1016\/B978-044482830-9\/50023-0_bib17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/37.4.243","article-title":"Process algebra with iteration and nesting","volume":"37","author":"Bergstra","year":"1994","journal-title":"Comput. J."},{"issue":"1\/2","key":"10.1016\/B978-044482830-9\/50023-0_bib18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0167-6423(96)00035-4","article-title":"Grid protocols based on synchronous communication","volume":"29","author":"Bergstra","year":"1997","journal-title":"Sci. Comput. Programming"},{"issue":"1\/3","key":"10.1016\/B978-044482830-9\/50023-0_bib19","first-page":"109","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.1016\/B978-044482830-9\/50023-0_bib20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"37","author":"Bergstra","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib21","series-title":"Proceedings Spring School on Mathematical Methods of Specification and Synthesis of Software Systems 85","first-page":"9","article-title":"Verification of an alternating bit protocol by means of process algebra","author":"Bergstra","year":"1986"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib22","series-title":"Proceedings 4th Workshop on Logics of Programs","first-page":"34","article-title":"Algebraic tools for system construction","author":"Bergstra","year":"1984"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib23","article-title":"Two recursive generalizations of iteration in process algebra","author":"Bergstra","year":"1998","journal-title":"Report P9808, Programming Research Group, University of Amsterdam"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib24","series-title":"Register machine based processes","author":"Bergstra","year":"1999"},{"issue":"1","key":"10.1016\/B978-044482830-9\/50023-0_bib25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0960129500000104","article-title":"Equational axioms for regular sets","volume":"3","author":"Bloom","year":"1993","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"10.1016\/B978-044482830-9\/50023-0_bib26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1993.1001","article-title":"Iteration theories of synchronization trees","volume":"102","author":"Bloom","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib27","article-title":"Expressiveness results for process algebra with iteration","author":"Boselie","year":"1995","journal-title":"Master's Thesis, University of Amsterdam"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib28","article-title":"Grammars modulo bisimulation","author":"Bosscher","year":"1997","journal-title":"Ph.D. Thesis, University of Amsterdam"},{"issue":"4","key":"10.1016\/B978-044482830-9\/50023-0_bib29","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1990240403391","article-title":"Graphes canoniques de graphes alg\u00e9briques","volume":"24","author":"Caucal","year":"1990","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib30","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/320924.320931","article-title":"Realization of events by logical nets","volume":"5","author":"Copi","year":"1958","journal-title":"J. ACM"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib31","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib32","series-title":"Proceedings 6th Conference on Concurrency Theory (CONCUR'95)","first-page":"130","article-title":"Fully abstract models for nondeterministic regular expressions","author":"Corradini","year":"1995"},{"issue":"3","key":"10.1016\/B978-044482830-9\/50023-0_bib33","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1006\/jcss.1999.1636","article-title":"Models of nondeterministic regular expressions","volume":"59","author":"Corradini","year":"1999","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/B978-044482830-9\/50023-0_bib34","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1051\/ita:1999127","article-title":"A finite axiomatization of nondeterministic regular expressions","volume":"33","author":"Corradini","year":"1999","journal-title":"Theoret. Inform. Appl."},{"issue":"6","key":"10.1016\/B978-044482830-9\/50023-0_bib35","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0020-0190(99)00073-3","article-title":"A note on equations for commutative regular languages","volume":"70","author":"Crvenkovi\u0107","year":"1999","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"10.1016\/B978-044482830-9\/50023-0_bib36","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0020-0190(94)00163-4","article-title":"A complete equational axiomatization for prefix iteration","volume":"52","author":"Fokkink","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/B978-044482830-9\/50023-0_bib37","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/FI-1996-26201","article-title":"A complete axiomatization for prefix iteration in branching bisimulation","volume":"26","author":"Fokkink","year":"1996","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib38","series-title":"Proceedings 5th Conference on Algebraic Methodology and Software Technology (AMAST'96)","first-page":"180","article-title":"On the completeness of the equations for the Kleene star in bisimulation","author":"Fokkink","year":"1996"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib39","series-title":"Proceedings 24th Colloquium on Automata, Languages and Programming (ICALP'97)","first-page":"571","article-title":"Axiomatizations for the perpetual loop in process algebra","author":"Fokkink","year":"1997"},{"issue":"1\/2","key":"10.1016\/B978-044482830-9\/50023-0_bib40","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0304-3975(98)00267-9","article-title":"Language preorder as a precongruence","volume":"243","author":"Fokkink","year":"2000","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/B978-044482830-9\/50023-0_bib41","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1006\/jcss.1999.1663","article-title":"Rooted branching bisimulation as a congruence","volume":"60","author":"Fokkink","year":"2000","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib42","series-title":"Introduction to Process Algebra","author":"Fokkink","year":"2000"},{"issue":"1","key":"10.1016\/B978-044482830-9\/50023-0_bib43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.0030","article-title":"Ntyft\/ntyxt rules reduce to ntree rules","volume":"126","author":"Fokkink","year":"1996","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/B978-044482830-9\/50023-0_bib44","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","article-title":"Basic process algebra with iteration: Completeness of its equational axioms","volume":"37","author":"Fokkink","year":"1994","journal-title":"Comput. J."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib45","series-title":"Proceedings 1st Conference on Concurrency Theory (CONCUR'90)","first-page":"278","article-title":"The linear time - branching time spectrum","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib46","series-title":"Proceedings 18th Symposium on Mathematical Foundations of Computer Science (MFCS'93)","first-page":"473","article-title":"A complete axiomatization for branching bisimulation congruence of finite-state behaviours","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib47","series-title":"Proceedings 4th Conference on Concurrency Theory (CONCUR'93)","first-page":"66","article-title":"The linear time \u2013 branching time spectrum II: The semantics of sequential systems with silent moves","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib48","series-title":"Proceedings 8th Conference on Concurrency Theory (CONCUR'98)","first-page":"228","article-title":"Axiomatizing flat iteration","author":"van Glabbeek","year":"1997"},{"issue":"3","key":"10.1016\/B978-044482830-9\/50023-0_bib49","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","article-title":"Branching time and abstraction in bisimulation semantics","volume":"43","author":"van Glabbeek","year":"1996","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/B978-044482830-9\/50023-0_bib50","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Inform. and Comput."},{"issue":"1","key":"10.1016\/B978-044482830-9\/50023-0_bib51","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/S0019-9958(81)90082-6","article-title":"A term model for synchronous processes","volume":"51","author":"Hennessy","year":"1981","journal-title":"Inform. and Control"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib52","series-title":"Representation of events in nerve nets and finite automata","author":"Kleene","year":"1951"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib53","series-title":"Automata Studies","first-page":"3","article-title":"Representation of events in nerve nets and finite automata","author":"Kleene","year":"1956"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib54","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib55","article-title":"A structure theory for communication network control","author":"Koomen","year":"1982","journal-title":"Ph.D. Thesis, Delft Technical University"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib56","article-title":"Extending process algebra with the empty process \u03b5","author":"Koymans","year":"1985"},{"issue":"2","key":"10.1016\/B978-044482830-9\/50023-0_bib57","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/inco.1994.1037","article-title":"A completeness theorem for Kleene algebras and the algebra of regular events","volume":"110","author":"Kozen","year":"1994","journal-title":"Inform. and Comput."},{"issue":"2","key":"10.1016\/B978-044482830-9\/50023-0_bib58","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","article-title":"Complete systems of B-rational identities","volume":"89","author":"Krob","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib59","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","article-title":"A logical calculus of ideas immanent in nervous activity","volume":"5","author":"McCulloch","year":"1943","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib60","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","article-title":"A Calculus of Communicating Systems","author":"Milner","year":"1980"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib61","series-title":"Proceedings 6th Colloquium on Trees in Algebra and Programming (CAAP'81)","first-page":"25","article-title":"A modal characterisation of observable machine-behaviour","author":"Milner","year":"1981"},{"issue":"3","key":"10.1016\/B978-044482830-9\/50023-0_bib62","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","article-title":"A complete inference system for a class of regular behaviours","volume":"28","author":"Milner","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib63","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"2","key":"10.1016\/B978-044482830-9\/50023-0_bib64","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","article-title":"A complete axiomatisation for observational congruence of finite-state behaviours","volume":"81","author":"Milner","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/B978-044482830-9\/50023-0_bib65","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib66","series-title":"Proceedings 5th GI (Gesellschaft f\u00fcr Informatik) Conference","first-page":"167","article-title":"Concurrency and automata on infinite sequences","author":"Park","year":"1981"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib67","first-page":"273","article-title":"Equational reasoning and term rewriting systems","volume":"Vol. 1","author":"Plaisted","year":"1993"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib68","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981","journal-title":"Report DAIMI FN-19, Computer Science Department, Aarhus University"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib69","first-page":"120","article-title":"On defining relations for the algebra of regular events","volume":"16","author":"Redko","year":"1964","journal-title":"Ukrain. Mat. Zh."},{"issue":"1","key":"10.1016\/B978-044482830-9\/50023-0_bib70","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","article-title":"Two complete axiom systems for the algebra of regular events","volume":"13","author":"Salomaa","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib71","article-title":"Theory of Automata","author":"Salomaa","year":"1969"},{"issue":"1\/3","key":"10.1016\/B978-044482830-9\/50023-0_bib72","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0168-0072(97)00036-5","article-title":"Nonaxiomatisability of equivalences over finite state processes","volume":"90","author":"Sewell","year":"1997","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"10.1016\/B978-044482830-9\/50023-0_bib73","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1017\/S0960129500000116","article-title":"Step bisimulation is pomset equivalence on a parallel language without explicit internal choice","volume":"3","author":"Troeger","year":"1993","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"10.1016\/B978-044482830-9\/50023-0_bib74","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0304-3975(96)00250-2","article-title":"The algebra of communicating processes with empty process","volume":"177","author":"Vrancken","year":"1997","journal-title":"Theoret. Comput. Sci."},{"issue":"1\/2","key":"10.1016\/B978-044482830-9\/50023-0_bib75","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","article-title":"Termination of term rewriting by semantic labelling","volume":"24","author":"Zantema","year":"1995","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/B978-044482830-9\/50023-0_bib76","series-title":"Proceedings 3rd Workshop on Formal Methods for Industrial Critical Systems (FMICS'98)","first-page":"347","article-title":"Some verifications in process algebra with iota","author":"van der Zwaag","year":"1998"}],"container-title":["Handbook of Process Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444828309500230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444828309500230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T04:57:05Z","timestamp":1587963425000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444828309500230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9780444828309"],"references-count":76,"URL":"https:\/\/doi.org\/10.1016\/b978-044482830-9\/50023-0","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}