{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:30Z","timestamp":1725489510743},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678953"},{"type":"electronic","value":"9783540446224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44622-2_20","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:32:38Z","timestamp":1187253158000},"page":"302-316","source":"Crossref","is-referenced-by-count":6,"title":["Axiomatizing the Least Fixed Point Operation and Binary Supremum"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1017\/S0960129597002491","volume":"8","author":"L. Aceto","year":"1998","unstructured":"L. Aceto, W.J. Fokkink and A. Ing\u00f3lfsd\u00f3ttir, A menagerie of non-finitely based process semantics over BPA*: from ready simulation to completed traces, Math. Struct. Comput. Sci., 8(1998), 193\u2013230.","journal-title":"Math. Struct. Comput. Sci."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0304-3975(97)00104-7","volume":"209","author":"L. Aceto","year":"1998","unstructured":"L. Aceto, W.J. Fokkink and A. Ing\u00f3lfsd\u00f3ttir, On a question of A. Salomaa: The equational theory of regular expressions over a singleton alphabet is not finitely based, Theoret. Comput. Sci., 209(1998), 163\u2013178.","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR3","unstructured":"J.W. De Bakker and D. Scott, A theory of programs, IBM Seminar, Vienna, 1969."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/BF03180566","volume":"4","author":"J. Balcazar","year":"1992","unstructured":"J. Balcazar, J. Gabarro and M. Santha, Deciding bisimilarity is P-complete, Formal Aspects of Computing, 4(1992), 638\u2013648.","journal-title":"Formal Aspects of Computing"},{"key":"20_CR5","volume-title":"Technical Report","author":"H. Beki\u0107","year":"1969","unstructured":"H. Beki\u0107, Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report, IBM Laboratory, Vienna, 1969."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0304-3975(89)90010-8","volume":"63","author":"D. Benson","year":"1989","unstructured":"D. Benson and J. Tiuryn, Fixed points in free process algebras, Theoret. Comput. Sci., 63(1989), 275\u2013294.","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0022-0000(76)80030-X","volume":"13","author":"S.L. Bloom","year":"1976","unstructured":"S.L. Bloom, Varieties of ordered algebras, J. Comput. System Sci., 13(1976), 200\u2013212.","journal-title":"J. Comput. System Sci."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. \u00c9sik, Iteration Theories, Springer-Verlag, 1993.","DOI":"10.1007\/978-3-642-78034-9"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00248-4","volume":"179","author":"S.L. Bloom","year":"1997","unstructured":"S.L. Bloom and Z. \u00c9sik, The equational logic of fixed points, Theoret. Comput. Sci., 179(1997), 1\u201360.","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR10","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"J.H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, London, 1971."},{"key":"20_CR11","unstructured":"F. Corradini, R. De Nicola and A. Labella, Tree morphisms and bisimulations, in: Proc. MFCS\u201998 Workshop on Concurrency, ENTCS, 18(1998)."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1051\/ita:1999127","volume":"33","author":"F. Corradini","year":"1999","unstructured":"F. Corradini, R. De Nicola and A. Labella, A finite axiomatization of nondeterministic regular expressions, Theoret. Inform. Appl., 33(1999), 447\u2013465.","journal-title":"Theoret. Inform. Appl."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1006\/jcss.1999.1636","volume":"59","author":"F. Corradini","year":"1999","unstructured":"F. Corradini, R. De Nicola and A. Labella, Models of nondeterministic regular expressions. J. Comput. Sys. Sci., 59:412\u2013449, 1999.","journal-title":"J. Comput. Sys. Sci."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(96)00240-X","volume":"177","author":"Z. \u00c9sik","year":"1997","unstructured":"Z. \u00c9sik, Completeness of Park induction, Theoret. Comput. Sci., 177(1997), 217\u2013283.","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"Z. \u00c9sik","year":"1999","unstructured":"Z. \u00c9sik, Group axioms for iteration, Inform. and Comput., 148(1999), 131\u2013180.","journal-title":"Inform. and Comput."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","volume":"37","author":"W. Fokkink","year":"1994","unstructured":"W. Fokkink and H. Zantema, Basic process algebra with iteration: Completeness of its equational axioms. Computer Journal, 37(1994), 259\u2013267.","journal-title":"Computer Journal"},{"key":"20_CR17","unstructured":"R.J.H. van Glabbeek, The linear time-branching time spectrum, Chapter 1 in: Comparative Concurrency Semantics and Refinement of Actions, R.J.H. van Glabbeek, CWI TRACT 109, 1996."},{"key":"20_CR18","unstructured":"C.C. Gunter, Semantics of Programming Languages, MIT Press, 1992."},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P.C. Kanellakis","year":"1990","unstructured":"P.C. Kanellakis and S.A. Smolka, CCS expressions, finite state processes and three problems of equivalence, Inform. and Comput., 86(1990), 43\u201368.","journal-title":"Inform. and Comput."},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, Inform. and Comput., 110(1994), 366\u2013390.","journal-title":"Inform. and Comput."},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D. Krob","year":"1991","unstructured":"D. Krob, Complete systems of B-rational identities, Theoret. Comput. Sci., 89(1991), 207\u2013343.","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"R. Milner, A complete inference system for a class of regular behaviours, J. Comput. Syst. Sci., 28(1984), 439\u2013466.","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR23","unstructured":"R. Milner, Communication and Concurrency, Prentice-Hall, 1989."},{"key":"20_CR24","unstructured":"D.M.R. Park, Fixpoint induction and proofs of program properties, in: Machine Intelligence\n                           5, D. Michie and B. Meltzer, Eds., Edinburgh Univ. Press, 1970, 59\u201378."},{"key":"20_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proc. GI Conference","author":"D.M.R. Park","year":"1981","unstructured":"D.M.R. Park, Concurrency and automata on infinite sequences, in: Proc. GI Conference, P. Deussen, Ed., LNCS104, Springer-Verlag, 1981, 167\u2013183."},{"key":"20_CR26","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A. Salomaa","year":"1966","unstructured":"A. Salomaa, Two complete axiom systems for the algebra of regular events. J. Assoc. Comput. Mach., 13(1966), 158\u2013169.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44622-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T22:39:41Z","timestamp":1550788781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44622-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678953","9783540446224"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44622-2_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}