{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:22Z","timestamp":1761611062366},"reference-count":35,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":5707,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0168-0072(97)00036-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:00:04Z","timestamp":1051124404000},"page":"163-191","source":"Crossref","is-referenced-by-count":20,"title":["Nonaxiomatisability of equivalences over finite state processes"],"prefix":"10.1016","volume":"90","author":[{"given":"Peter","family":"Sewell","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0168-0072(97)00036-5_BIB1","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/inco.1996.0047","article-title":"A. Ing\u00f3lfsd\u00f3ttir, Axiomatizing prefix iteration with silent steps","volume":"127","author":"Aceto","year":"1996","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0168-0072(97)00036-5_BIB2","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129597002491","article-title":"A menagerie of non-finitely based process semantics over BPA\u2217: from ready simulation semantics to completed traces","author":"Aceto","year":"1996"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB3","doi-asserted-by":"crossref","DOI":"10.7146\/brics.v2i5.19507","article-title":"A complete equational axiomatization for prefix iteration with silent steps","author":"Aceto","year":"1995"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB4","first-page":"67","article-title":"Implicational axioms for the algebra of regular languages","volume":"10","author":"Arkhangelskii","year":"1987","journal-title":"Doklady Akad. Nauk USSR, Ser A"},{"issue":"4","key":"10.1016\/S0168-0072(97)00036-5_BIB5","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."},{"key":"10.1016\/S0168-0072(97)00036-5_BIB6","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\/S0168-0072(97)00036-5_BIB7","article-title":"Iteration Theories: The Equational Logic of Iterative Processes","author":"Bloom","year":"1993"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB8","article-title":"Iteration algebras of finite state process behaviors","author":"Bloom","year":"1994","journal-title":"Manuscript"},{"issue":"1","key":"10.1016\/S0168-0072(97)00036-5_BIB9","doi-asserted-by":"crossref","DOI":"10.1006\/inco.1993.1001","article-title":"Iteration theories of synchronization trees","volume":"102","author":"Bloom","year":"1993","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/S0168-0072(97)00036-5_BIB10","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1990240404191","article-title":"Une remarque sur les syst\u00e8mes complets d'identit\u00e9s rationelles","volume":"24","author":"Boffa","year":"1990","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/S0168-0072(97)00036-5_BIB11","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"issue":"2","key":"10.1016\/S0168-0072(97)00036-5_BIB12","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"},{"issue":"6","key":"10.1016\/S0168-0072(97)00036-5_BIB13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0020-0190(94)00163-4","article-title":"A complete equational axiomatisation for prefix iteration","volume":"52","author":"Fokkink","year":"1994","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0168-0072(97)00036-5_BIB14","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\/S0168-0072(97)00036-5_BIB15","doi-asserted-by":"crossref","DOI":"10.1145\/359576.359585","article-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB16","series-title":"Automata Studies","first-page":"3","article-title":"Representation of events in nerve nets and finite automata","volume":"34","author":"Kleene","year":"1956"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB17","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."},{"key":"10.1016\/S0168-0072(97)00036-5_BIB18","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."},{"issue":"3","key":"10.1016\/S0168-0072(97)00036-5_BIB19","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\/S0168-0072(97)00036-5_BIB20","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\/S0168-0072(97)00036-5_BIB21","article-title":"Axioms for Concurrency","author":"Moller","year":"1989"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB22","series-title":"Proc. PARLE '89","article-title":"The typed \u03bb-calculus with first-class processes","volume":"vol. 366","author":"Nielson","year":"1989"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB23","series-title":"Proc. 5th G.I. Conf.","article-title":"Concurrency and automata on infinite sequences","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB24","series-title":"Proc. Mathematical Foundations of Programming Semantics (IX)","first-page":"530","article-title":"A complete axiomatisation for trace congruence of finite state behaviors","volume":"vol. 802","author":"Rabinovich","year":"1993"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB25","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\/S0168-0072(97)00036-5_BIB26","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\/S0168-0072(97)00036-5_BIB27","article-title":"Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms","author":"Sangiorgi","year":"1993"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB28","series-title":"Proc. 9th IEEE Symp. on Logic in Computer Science","first-page":"62","article-title":"Bisimulation is not finitely (first-order) equationally axiomatisable","author":"Sewell","year":"1994"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB29","series-title":"Dept. of Computer Science Technical Report CST-118-95","article-title":"The Algebra of Finite State Processes","author":"Sewell","year":"1995"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB30","series-title":"Proc. CONCUR'90, Theories of Concurrency: Unification and Extension","first-page":"278","article-title":"The linear time-branching time spectrum (extended abstract)","volume":"vol. 458","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB31","series-title":"Proc. 18th Internat. Symp. on Mathematical Foundations of Computer Science, MFCS '93","first-page":"473","article-title":"A complete axiomatization for branching bisimulation congruence of finite-state behaviours","volume":"vol. 711","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB32","series-title":"Divergence bisimulation","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/S0168-0072(97)00036-5_BIB33_1","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(96)00250-2","article-title":"The algebra of communicating processes with empty process","author":"Vrancken","year":"1986"},{"issue":"2","key":"10.1016\/S0168-0072(97)00036-5_BIB33_2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0304-3975(96)00250-2","volume":"177","author":"Vrancken","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0168-0072(97)00036-5_BIB34","first-page":"108","article-title":"Regular Algebra and Finite Machines","author":"Yanov","year":"1971"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007297000365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007297000365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T01:50:17Z","timestamp":1556761817000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007297000365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":35,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0168007297000365"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(97)00036-5","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}