{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299735},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631415"},{"type":"electronic","value":"9783540691884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63141-0_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:09:02Z","timestamp":1330297742000},"page":"228-242","source":"Crossref","is-referenced-by-count":1,"title":["Axiomatizing flat iteration"],"prefix":"10.1007","author":[{"given":"R. J.","family":"Glabbeek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"16_CR1","unstructured":"L. Aceto and J.F. Groote (1995), A complete equational axiomatization for MPA with string iteration, BRICS Research Report RS-95-28, Department of Mathematics and Computer Science, Aalborg University. Available by anonymous ftp from ftp.daimi.aau.dk in the directory pub\/BRICS\/RS\/95\/28."},{"issue":"1","key":"16_CR2","first-page":"26","volume":"127","author":"L. Aceto","year":"1996","unstructured":"L. Aceto, W. Fokkink, R. van Glabbeek and A. Ing\u00f3lfsd\u00f3ttir (1996), Axiomatizing prefix iteration with silent steps, I&C 127(1), pp. 26\u201340.","journal-title":"I&C"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"L. Aceto and A. Ing\u00f3lfsd\u00f3ttir (1996), An equational axiomatization of observation congruence for prefix iteration, in Proc. AMAST '96, Munich, Germany, M. Wirsing and M. Nivat, eds., LNCS 1101, Springer-Verlag, pp. 195\u2013209.","DOI":"10.1007\/BFb0014316"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J. Baeten","year":"1987","unstructured":"J. Baeten, J. Bergstra and J. Klop (1987), On the consistency of Koomen's fair abstraction rule, TCS 51, pp. 129\u2013176.","journal-title":"TCS"},{"issue":"3","key":"16_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T. Basten","year":"1996","unstructured":"T. Basten (1996), Branching bisimilarity is an equivalence indeed!, IPL 58(3), pp. 141\u2013147.","journal-title":"IPL"},{"key":"16_CR6","unstructured":"J. Bergstra, I. Bethke and A. Ponse (1994), Process algebra with iteration and nesting, Computer Journal 37, pp. 243\u2013258. Originally appeared as report P9314, Programming Research Group, University of Amsterdam, 1993."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"J. Bergstra and J. 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"},{"key":"16_CR8","unstructured":"F. Corradini, R. De Nicola and A. Labella (1995), Fully abstract models for nondeterministic Kleene algebras (extended abstract), in Proc. CONCUR 95, Philadelphia, I. Lee and S. Smolka, eds., LNCS 962, Springer-Verlag, pp. 130\u2013144."},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0020-0190(94)00163-4","volume":"52","author":"W. Fokkink","year":"1994","unstructured":"W. Fokkink (1994), A complete equational axiomatization for prefix iteration, IPL 52, pp. 333\u2013337.","journal-title":"IPL"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/FI-1996-26201","volume":"26","author":"W. Fokkink","year":"1996","unstructured":"W. Fokkink (1996), A complete axiomatization for prefix iteration in branching bisimulation, Fundamenta Informaticae 26, pp. 103\u2013113.","journal-title":"Fundamenta Informaticae"},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","volume":"37","author":"W. Fokkink","year":"1994","unstructured":"W. Fokkink and H. Zantema (1994), Basic process algebra with iteration: Completeness of its equational axioms, Computer Journal 37, pp. 259\u2013267.","journal-title":"Computer Journal"},{"key":"16_CR12","unstructured":"R. V. Glabbeek (1995), Branching bisimulation as a tool in the analysis of weak bisimulation. Available at ftp:\/\/boole.stanford.edu\/pub\/DVI\/tool.dvi.gz."},{"issue":"3","key":"16_CR13","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R. V. Glabbeek","year":"1996","unstructured":"R. V. Glabbeek and W. Weijland (1996), Branching time and abstraction in bisimulation semantics, JACM 43(3), pp. 555\u2013600.","journal-title":"JACM"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner (1985), Algebraic laws for nondeterminism and concurrency, JACM 32, pp. 137\u2013161.","journal-title":"JACM"},{"key":"16_CR15","unstructured":"S. Kleene (1956), Representation of events in nerve nets and finite automata, in Automata Studies, C. Shannon and J. McCarthy, eds., Princeton University Press, pp. 3\u201341."},{"key":"16_CR16","unstructured":"R. Milner (1989), Communication and Concurrency, Prentice-Hall."},{"key":"16_CR17","first-page":"227","volume":"81","author":"R. Milner","year":"1989","unstructured":"R. Milner (1989), A complete axiomatisation for observational congruence of finite-state behaviours, I&C 81, pp. 227\u2013247.","journal-title":"I&C"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.-R. Olderog","year":"1986","unstructured":"E.-R. Olderog and C.A.R. Hoare (1986), Specification-oriented semantics for communicating processes, Acta Informatica 23, pp. 9\u201366.","journal-title":"Acta Informatica"},{"key":"16_CR19","first-page":"62","volume-title":"Proc. 9th LICS","author":"P. Sewell","year":"1994","unstructured":"P. Sewell (1994), Bisimulation is not finitely (first order) equationally axiomatisable, in Proc. 9th LICS, Paris, IEEE Computer Society Press, pp. 62\u201370."}],"container-title":["Lecture Notes in Computer Science","CONCUR '97: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63141-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:42:08Z","timestamp":1619574128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63141-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631415","9783540691884"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-63141-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}