{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:10Z","timestamp":1761596710614},"reference-count":175,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/s0304-3975(96)00248-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"1-60","source":"Crossref","is-referenced-by-count":25,"title":["The equational logic of fixed points"],"prefix":"10.1016","volume":"179","author":[{"given":"Stephen L.","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00248-4_BIB1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(94)00195-5","article-title":"Fixed-point calculus","volume":"53","author":"Aarts","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.4153\/CJM-1961-007-5","article-title":"A theorem on partially ordered sets with applications to fixed-point theorems","volume":"13","author":"Abian","year":"1961","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB3","series-title":"draft paper","article-title":"A menagerie of non-finitely based process semantics over BPA\u2217","author":"Aceto","year":"1996"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB4","first-page":"589","article-title":"Free algebras and automata realizations in the language of category theory","volume":"15","author":"Ad\u00e1mek","year":"1974","journal-title":"Comm. Math. Unive. Carolinae"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(79)90026-6","article-title":"Least fixed-point of a functor","volume":"19","author":"Ad\u00e1mek","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB6","series-title":"Automata and Algebras in Categories","author":"Ad\u00e1mek","year":"1990"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(04)00001-5","article-title":"Solutions of functorial and non-functorial metric domain equations","volume":"1","author":"Alessi","year":"1995","journal-title":"Electronic Notes Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0022-0000(89)90027-5","article-title":"Solving reflexive domain equations in a category of complete metric spaces","volume":"35","author":"America","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB9","article-title":"On the representation of distributive semilattice-ordered semigroups","author":"Andr\u00e9ka","year":"1988","journal-title":"Tech. Report, Math. Inst., Hungarian Academy of Science"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB10","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BF01190407","article-title":"Representations of distributive semilattice-ordered semigroups with binary relations","volume":"28","author":"Andr\u00e9ka","year":"1991","journal-title":"Algebra Universalis"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB11","series-title":"Mathematical Foundations of Computer Science'76","first-page":"212","article-title":"Free dynamics and algebraic semantics","volume":"Vol. 56","author":"Arbib","year":"1977"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0021-8693(80)90212-4","article-title":"Partially additive categories and flow-diagram semantics","volume":"62","author":"Arbib","year":"1980","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB13","article-title":"A new finite complete solvable quasi-equational calculus for the algebra of regular events","author":"Archangelsky","year":"1990"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB14","first-page":"67","article-title":"Implicational axioms for the algebra of regular languages","volume":"10","author":"Archangelsky","year":"1987","journal-title":"Dokl. Akad. Nauk USSR Ser. A"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1980-3405","article-title":"The metric space of infinite trees","volume":"4","author":"Arnold","year":"1980","journal-title":"Fundam. Inform."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(80)90045-6","article-title":"Metric interpretations of infinite trees and semantics of non deterministic recursive programs","volume":"11","author":"Arnold","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB17","series-title":"Category Theory and Computer Science'95","first-page":"159","article-title":"Categorical fixed-point calculus","volume":"Vol. 953","author":"Backhouse","year":"1995"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","article-title":"Regular algebra applied to path-finding problems","volume":"15","author":"Backhouse","year":"1975","journal-title":"J. Inst. Math. Appl."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB19","article-title":"Process Algebra","volume":"Vol. 18","author":"Baeten","year":"1990"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB20","series-title":"Proc. Inst. on the Logical Foundations of Functional Programming","article-title":"Functorial polymorphism","author":"Bainbridge","year":"1987"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00263291","article-title":"Order and metric in the stream semantics of elemental concurrency","volume":"24","author":"de Bakker","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB22","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and the denotational semantics of concurrency","volume":"54","author":"de Bakker","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB23","doi-asserted-by":"crossref","first-page":"133","DOI":"10.4064\/fm-3-1-133-181","article-title":"Sur les operations dans les ensembles abstraits et leur applications aux \u00e9quations int\u00e9grales","volume":"22","author":"Banach","year":"1922","journal-title":"Fundam. Math."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-3975(90)90152-8","article-title":"Fixed points in cartesian closed categories","volume":"70","author":"Barr","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB25","article-title":"Definable operations in general algebras, and the theory of automata and flowcharts","author":"Bekic\u0306","year":"1969","journal-title":"Tech. Report, IBM Laboratory"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB26","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0304-3975(89)90010-8","article-title":"Fixed points in free process algebras","volume":"63","author":"Benson","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB27","series-title":"Processes with multiple entries and exits modulo isomorphism and modulo bisimulation","author":"Bergstra","year":"1994"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB28","series-title":"Words, Combinatorics and Semigroups","first-page":"40","article-title":"Equational theories of relations and regular sets","author":"Bern\u00e1tsky","year":"1994"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB29","unstructured":"L. Bern\u00e1tsky and Z. \u00c9sik, Semantics of flowchart programs and the free Conway theories, submitted."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB30","series-title":"Logic Colloquium'86","first-page":"21","article-title":"A complete inference system for regular processes with silent moves","author":"Berstra","year":"1988"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB31","doi-asserted-by":"crossref","first-page":"209","DOI":"10.4064\/-9-1-209-224","article-title":"Iterative and metric algebraic theories","volume":"9","author":"Bloom","year":"1982","journal-title":"Banach Center Publications"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB32","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/0209002","article-title":"Solutions of the iteration equation and extension of the scalar iteration operation","volume":"9","author":"Bloom","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB33","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/0209039","article-title":"Vector iteration of pointed iterative theories","volume":"9","author":"Bloom","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB34","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0022-0000(85)90059-5","article-title":"Axiomatizing schemes and their behaviors","volume":"31","author":"Bloom","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB35","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1137\/0217059","article-title":"Varieties of iteration theories","volume":"17","author":"Bloom","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB36","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(89)90012-1","article-title":"Equational logic of circular data type specification","volume":"63","author":"Bloom","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB37","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."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB38","article-title":"Iteration Theories: The Equational Logic of Iterative Processes","author":"Bloom","year":"1993"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB39","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0022-0000(93)90010-T","article-title":"Matrix and matricial iteration theories","volume":"46","author":"Bloom","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB40","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0022-0000(93)90011-K","article-title":"Matrix and matricial iteration theories","volume":"46","author":"Bloom","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB41","series-title":"Mathematical Foundations of Programming Semantics","first-page":"378","article-title":"Some quasi-varieties of iteration theories","volume":"Vol. 802","author":"Bloom","year":"1993"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB42","series-title":"Iteration algebras of finite state process behaviors","author":"Bloom","year":"1994"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB43","series-title":"Mathematical Foundations of Computer Science'94","first-page":"52","article-title":"Solving polynomial fixed-point equations","volume":"Vol. 841","author":"Bloom","year":"1994"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB44","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/S0129054195000081","article-title":"Some equational laws of initiality in 2CCC's","volume":"6","author":"Bloom","year":"1995","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(95)00010-0","article-title":"Equational properties of fixed-points in ccc's","volume":"155","author":"Bloom","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB46","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BF01190768","article-title":"Notes on equational theories of relations","volume":"33","author":"Bloom","year":"1995","journal-title":"Algebra Universalis"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB47","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. Comput."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB48","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0022-0000(77)80015-9","article-title":"Scalar and vector iteration","volume":"14","author":"Bloom","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB49","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-0000(83)90037-5","article-title":"Recursion and iteration in continuous theories, the M-construction","volume":"27","author":"Bloom","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB50","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1990240404191","article-title":"Une remarque sur les systemes complets d'identites rationelles","volume":"24","author":"Boffa","year":"1990","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB51","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1051\/ita\/1995290605151","article-title":"Une condition impliquant toutes les identites rationelles","volume":"29","author":"Boffa","year":"1995","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB52","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(94)90276-3","article-title":"A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring","volume":"134","author":"Bounier-Rigny","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB53","article-title":"Feedback, iteration and repetition","author":"Cazanescu","year":"1988"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB54","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1990-13204","article-title":"Towards a new algebraic foundation of flowchart scheme theory","volume":"13","author":"Cazanescu","year":"1990","journal-title":"Fundam. Inform."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(92)90171-B","article-title":"A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization","volume":"99","author":"Cazanescu","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB56","series-title":"Universal Algebra","author":"Cohn","year":"1965"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB57","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB58","article-title":"Models of nondeterministic regular expressions","author":"Corradini","year":"1996","journal-title":"Draft Paper"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB59","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","article-title":"Fundamental properties of infinite trees","volume":"25","author":"Courcelle","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB60","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0022-0000(78)90016-8","article-title":"On some classes of interpretations","volume":"17","author":"Courcelle","year":"1978","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB61","series-title":"Proc. Automata, Languages and Programming'74","first-page":"200","article-title":"Algorithmes d'equivalence at de reduction a des expressions minimales dans une classe d'equations recursives simples","volume":"Vol. 14","author":"Courcelle","year":"1974"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB62","series-title":"Proc. IEEE Symp. on Foundations of Computer Science","first-page":"137","article-title":"Algebraic families of interpretations","author":"Courcelle","year":"1976"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB63","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(93)90228-L","article-title":"On Kleene algebras","volume":"108","author":"Crvenkovic\u0306","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB64","series-title":"Automata and Infinite Words","first-page":"68","article-title":"A formal proof system for infinitary rational expressions","volume":"Vol. 192","author":"Dorondeau","year":"1984"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB65","volume":"Vols. A and B","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB66","unstructured":"S. Eilenberg, The category, unpublished handwritten manuscript."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB67","first-page":"175","article-title":"Monadic computation and iterative algebraic theories","volume":"Vol. 80","author":"Elgot","year":"1975"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB68","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0021-8693(76)90106-X","article-title":"Matricial theories","volume":"42","author":"Elgot","year":"1976","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB69","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TSE.1976.233800","article-title":"Structured programming with and without goto statements","volume":"SE-2","author":"Elgot","year":"1976","journal-title":"IEEE Trans Software Eng."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB70","series-title":"Fundamentals of Computation Theory","first-page":"256","article-title":"Some geometrical categories associated with flowchart schemes","volume":"Vol. 56","author":"Elgot","year":"1977"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB71","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","article-title":"On the algebraic structure of rooted trees","volume":"16","author":"Elgot","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB72","first-page":"183","article-title":"Identities in iterative algebraic theories","volume":"14","author":"\u00c9sik","year":"1980","journal-title":"Comput. Linguistics Comput. Languages"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB73","first-page":"95","article-title":"On generalized iterative algebraic theories","volume":"15","author":"\u00c9sik","year":"1982","journal-title":"Comput. Linguistics Comput. Languages"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB74","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0022-0000(83)90044-2","article-title":"Algebras of iteration theories","volume":"27","author":"\u00c9sik","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB75","first-page":"147","article-title":"On the weak equivalence of Bigot's flowchart schemes","volume":"7","author":"\u00c9sik","year":"1985","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB76","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0022-0000(88)90020-7","article-title":"Independence of the equational axioms of iteration theories","volume":"36","author":"\u00c9sik","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB77","first-page":"375","article-title":"A note on the axiomatization of iteration theories","volume":"9","author":"\u00c9sik","year":"1990","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB78","doi-asserted-by":"crossref","unstructured":"Z. \u00c9sik, Completeness of Park induction, Theoret. Comput. Sci. to appear.","DOI":"10.1016\/S0304-3975(96)00240-X"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB79","unstructured":"Z. \u00c9sik, Group axioms for iteration, submitted."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB80","unstructured":"Z. \u00c9sik, A proof of the Krohn-Rhodes decomposition theorem, submitted."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB81","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(94)00041-G","article-title":"Equational properties of Kleene algebras of relations with conversion","volume":"137","author":"\u00c9sik","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB82","series-title":"Mathematical Foundations of Programming Semantics'95","article-title":"Scott induction and equational proofs","volume":"Vol. 1","author":"\u00c9sik","year":"1995"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB83","series-title":"Talk Presented at MFPS '12","article-title":"Independence of the group axioms for iteration","author":"\u00c9sik","year":"1996"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB84","series-title":"Mathematical Foundations of Computer Science'96","first-page":"336","article-title":"Equational properties of iteration in algebraically complete categories","volume":"Vol. 1113","author":"\u00c9sik","year":"1996"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB85","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\/S0304-3975(96)00248-4_BIB86","series-title":"Category Theory","first-page":"95","article-title":"Algebraically complete categories","volume":"Vol. 1488","author":"Freyd","year":"1991"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB87","series-title":"Applications of Categories in Computer Science","first-page":"95","article-title":"Remarks on algebraically compact categories","volume":"Vol. 77","author":"Freyd","year":"1992"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB88","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0022-0000(81)90006-4","article-title":"Recursion-closed algebraic theories","volume":"23","author":"Gallier","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB89","series-title":"Algebraic Methods in Semantics","first-page":"313","article-title":"The semantics of recursive programs with function parameters of finite types: n-rational algebras and logic of inequalities","author":"Gallier","year":"1985"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB90","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0022-0000(79)90032-1","article-title":"Regular trees and the free iterative theory","volume":"18","author":"Ginali","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB91","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","article-title":"Two families of languages related to ALGOL","volume":"9","author":"Ginsburg","year":"1962","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB92","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB93","series-title":"The Theory of Semirings with Applications in Computer Science","author":"Golan","year":"1993"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB94","article-title":"Algebraic Semantics","volume":"Vol. 99","author":"Guessarian","year":"1981"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB95","first-page":"55","article-title":"The Kleene theorem in countably complete semirings","volume":"31","author":"Hebisch","year":"1990","journal-title":"Bayruether Math. Schriften"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB96","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB97","series-title":"Current Trends in Concurrency","article-title":"Infinitary languages: basic theory and applications to concurrent systems","volume":"Vol. 224","author":"Hoogeboom","year":"1986"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB98","article-title":"The logic of recursive equations","author":"Hurkens","year":"1996","journal-title":"Draft Paper"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB99","first-page":"82","article-title":"The logical schemes of algorithms","volume":"Vol. 1","author":"Ianov","year":"1960"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB100","series-title":"Proc. ICALP'84","first-page":"260","article-title":"A complete axiom system for algebra of closed-regular expressions","volume":"Vol. 172","author":"Izumi","year":"1984"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB101","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB102","series-title":"Proc. MFCS '90","first-page":"26","article-title":"On Kleene algebras and closed semirings","volume":"Vol. 452","author":"Kozen","year":"1990"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB103","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. Comput."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB104","first-page":"323","article-title":"Monoides et semi-anneaux complets","volume":"36","author":"Krob","year":"1987"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB105","article-title":"On aperiodic semigroups","author":"Krob","year":"1989","journal-title":"LITP Report Series, 89-76"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB106","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1051\/ita\/1991250504231","article-title":"Matrix versions of aperiodic K-rational identities","volume":"25","author":"Krob","year":"1991","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB107","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\/S0304-3975(96)00248-4_BIB108","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0022-0000(92)90033-F","article-title":"Models of a K-rational identity system","volume":"45","author":"Krob","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB109","series-title":"Proc. ICALP'87","first-page":"212","article-title":"The Kleene and Parikh theorem in complete semirings","author":"Kuich","year":"1987"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB110","series-title":"Proc. ICALP '90","first-page":"103","article-title":"\u03c9-continuous semirings, algebraic systems and pushdown automata","volume":"Vol. 443","author":"Kuich","year":"1990"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB111","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(91)90147-T","article-title":"Automata and languages generalized to \u03c9-continuous semirings","volume":"79","author":"Kuich","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB112","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69959-7","article-title":"Semirings, Automata and Languages","author":"Kuich","year":"1986"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB113","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB114","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01110627","article-title":"A fixpoint theorem for complete categories","volume":"103","author":"Lambek","year":"1968","journal-title":"Math. Z."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB115","first-page":"869","article-title":"Functorial semantics of algebraic theories","volume":"50","author":"Lawvere","year":"1963"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB116","first-page":"134","article-title":"Diagonal arguments and cartesian closed categories","volume":"Vol. 92","author":"Lawvere","year":"1969"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB117","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","article-title":"Algebraic structures for transitive closure","volume":"4","author":"Lehmann","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB118","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01752392","article-title":"Algebraic specification of data types: a synthetic approach","volume":"14","author":"Lehmann","year":"1981","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB119","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0890-5401(91)90005-M","article-title":"Towards a foundation for semantics in complete metric spaces","volume":"90","author":"Majster-Cederbaum","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB120","series-title":"Predicate Transformer Semantics","author":"Manes","year":"1992"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB121","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4962-7","article-title":"Algebraic Approaches to Program Semantics","author":"Manes","year":"1986"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB122","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB123","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02485815","article-title":"Chain-complete posets and directed sets with applications","volume":"6","author":"Markowsky","year":"1976","journal-title":"Algebra Universalis"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB124","article-title":"A Calculus for Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB125","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\/S0304-3975(96)00248-4_BIB126","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0890-5401(89)90070-9","article-title":"A complete axiomatization for observational congruence of finite state behaviours","volume":"81","author":"Milner","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB127","series-title":"Proc. Logic Coll.","first-page":"289","article-title":"Abstract recursion as a foundation for the theory of algorithms","volume":"Vol. 1104","author":"Moschovakis","year":"1983"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB128","series-title":"Proc. Internat. Congr. for Logic. Methodology and Philosophy of Science","article-title":"The logic of functional recursion","author":"Moschovakis","year":"1995"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB129","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(90)90154-A","article-title":"Categorical fixed-point semantics","volume":"70","author":"Mulry","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB130","series-title":"Abstract 742-02-09","first-page":"A29","article-title":"Relation algebras with transitive closure","volume":"24","author":"Ng","year":"1977"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB131","series-title":"Proc. Conf. MFCS'94","first-page":"536","article-title":"A completeness theorem for nondeterministic Kleene algebras","volume":"Vol. 841","author":"De Nicola","year":"1994"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB132","first-page":"255","article-title":"On the interpretation of recursive polyadic program schemes","volume":"XV","author":"Nivat","year":"1975"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB133","series-title":"Proc. ICALP'86","first-page":"464","article-title":"On fixed-point clones","volume":"Vol. 226","author":"Niwinski","year":"1986"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB134","first-page":"59","article-title":"Fixpoint induction and proofs of program properties","volume":"Vol. 5","author":"Park","year":"1970"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB135","series-title":"Proc. GI Conf.","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB136","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(86)90179-9","article-title":"Scott induction and closure under \u03c9-sups","volume":"45","author":"Pasztor","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB137","article-title":"Domains","author":"Plotkin","year":"1983"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB138","series-title":"Logics in AI: European Workshop JELIA'90","first-page":"97","article-title":"Action logic and pure induction","volume":"Vol. 478","author":"Pratt","year":"1991"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB139","series-title":"Proc. Mathematical Foundations of Programming Semantics'93","first-page":"530","article-title":"A complete axiomatization for trace congruence of finite state behaviors","volume":"Vol. 802","author":"Rabinovitch","year":"1994"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB140","first-page":"120","article-title":"On the determining totality of relations of an algebra of regular events","volume":"16","author":"Redko","year":"1964","journal-title":"Ukrain. Mat. Z."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB141","first-page":"185","article-title":"On the algebra of commutative events","volume":"16","author":"Redko","year":"1964","journal-title":"Ukrain. Mat. Z."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB142","series-title":"Algebraic Logic and Universal Algebra in Computer Science","first-page":"195","article-title":"Maltsev algebras for universal algebra terms","volume":"Vol. 425","author":"Rosenberg","year":"1990"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB143","series-title":"Trends, Techniques and Problems in Theoretical Computer Science","first-page":"39","article-title":"Kleene's theorem revisited","volume":"Vol. 281","author":"Sakarovitch","year":"1987"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB144","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","article-title":"Two complete axioms systems for the algebra of regular events","volume":"13","author":"Salomaa","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB145","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01703264","article-title":"On regular expressions and regular canonical systems","volume":"2","author":"Salomaa","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB146","series-title":"Automata Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB147","series-title":"Semantics of Algorithmic Languages","first-page":"311","article-title":"The lattice of flow diagrams","volume":"Vol. 182","author":"Scott","year":"1971"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB148","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB149","series-title":"A theory of programs","author":"Scott","year":"1969"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB150","first-page":"885","article-title":"On a theorem of R. Jungen","volume":"13","author":"Sch\u00fctzenberger","year":"1962"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB151","series-title":"Proc. LICS'94","first-page":"62","article-title":"Bisimulation is not finitely (first order) equationally axiomatisable","author":"Sewell","year":"1994"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB152","article-title":"Nonaxiomatisability of equivalences over finite state processes","author":"Sewell","year":"1996","journal-title":"Draft Paper"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB153","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(93)90112-7","article-title":"A characterisation of the least fixed-point operator by dinaturality","volume":"118","author":"Simpson","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB154","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The category theoretic solution of recursive domain equations","volume":"11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB155","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-0000(87)90011-0","article-title":"On flowchart theories: Part I. The deterministic case","volume":"35","author":"Stefanescu","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB156","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(87)90114-9","article-title":"On flowchart theories","volume":"52","author":"Stefanescu","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB157","first-page":"73","article-title":"Feedback theories","volume":"35","author":"Stefanescu","year":"1990","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB158","series-title":"Clones in Universal Algebra","author":"Szendrei","year":"1986"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB159","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB160","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/FI-1978-2108","article-title":"Fixed-points and algebras with infinitely long expressions. Part I: regular algebras","volume":"2","author":"Tiuryn","year":"1978","journal-title":"Fundam. Inform."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB161","doi-asserted-by":"crossref","first-page":"317","DOI":"10.3233\/FI-1978-2120","article-title":"Fixed-points and algebras with infinitely long expressions. Part II: \u03bc-clones of regular algebras","volume":"2","author":"Tiuryn","year":"1979","journal-title":"Fundam. Inform."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB162","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0304-3975(80)90056-0","article-title":"Unique fixed-points vs. least fixed-points","volume":"12","author":"Tiuryn","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB163","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3233\/FI-1982-5205","article-title":"Metric iteration theories","volume":"2","author":"Troeger","year":"1982","journal-title":"Fundam. Inform."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB164","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."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB165","series-title":"Proc. Automata, Languages and Programming'72","first-page":"331","article-title":"A concrete approach to abstract recursive definitions","author":"Wand","year":"1973"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB166","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(79)90053-7","article-title":"Fixed-point constructions in order enriched categories","volume":"8","author":"Wand","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB167","first-page":"380","article-title":"Generalized semialgebras over semirings","volume":"Vol. 1320","author":"Weinert","year":"1988"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB168","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0304-3975(84)90112-9","article-title":"Synchronization trees","volume":"34","author":"Winskel","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00248-4_BIB169","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","article-title":"The Formal Semantics of Programming Languages","author":"Winskel","year":"1993"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB170","article-title":"Algebraic semantics","volume":"Vol. 2","author":"Wagner","year":"1994"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB171","article-title":"Solving recursive domain equations with enriched categories","author":"Wagner","year":"1994"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB172","series-title":"17th IEEE Symp. Foundations of Computing","first-page":"147","article-title":"Rational algebraic theories and fixed-point solutions","author":"Wright","year":"1976"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB173","series-title":"Proc. Symp. Mathematical Foundations of Computer Science","first-page":"153","article-title":"Some fundamentals of order-algebraic semantics","volume":"Vol. 45","author":"Wright","year":"1976"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB174","article-title":"\u03c9-complete semirings and matrix iteration theories","author":"Xie","year":"1991"},{"key":"10.1016\/S0304-3975(96)00248-4_BIB175","series-title":"Logic of Domains","author":"Zhang","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002484?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002484?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T01:44:43Z","timestamp":1681609483000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":175,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0304397596002484"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00248-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}