{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:56:13Z","timestamp":1768287373457,"version":"3.49.0"},"reference-count":39,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":7078,"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":[[1994,3]]},"DOI":"10.1016\/0304-3975(94)90254-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"167-204","source":"Crossref","is-referenced-by-count":14,"title":["An extension of Kleene's and Ochma\u0144ski's theorems to infinite traces"],"prefix":"10.1016","volume":"125","author":[{"given":"Paul","family":"Gastin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wies\u0142aw","family":"Zielonka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90254-2_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","article-title":"Theory of traces","volume":"60","author":"Aalbersberg","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90254-2_BIB2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","article-title":"A syntactic congruence for rational \u03c9-languages","volume":"39","author":"Arnold","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90254-2_BIB3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(87)90090-9","article-title":"Sequential and concurrent behaviour in Petri net theory","volume":"55","author":"Best","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90254-2_BIB4","series-title":"Proc. ASMICS workshop on Free Partially Commutative Monoids","first-page":"1","article-title":"About infinite traces","author":"Bonizzoni","year":"1990"},{"key":"10.1016\/0304-3975(94)90254-2_BIB5","series-title":"Proc. Internat. Congr. on Logic, Methodology and Philosophy","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/0304-3975(94)90254-2_BIB6","article-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements","volume":"Vol. 85","author":"Cartier","year":"1969"},{"key":"10.1016\/0304-3975(94)90254-2_BIB7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0890-5401(87)90040-X","article-title":"Semi-commutations","volume":"73","author":"Clerbout","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(94)90254-2_BIB8","series-title":"Tech. Report LaBRI 89\u201397","article-title":"Asynchronous mappings and asynchronous cellular automata","author":"Cori","year":"1990"},{"key":"10.1016\/0304-3975(94)90254-2_BIB9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","article-title":"Automates et commutations partielles","volume":"19","author":"Cori","year":"1985","journal-title":"RAIRO \u2014 Inform. Th\u00e9orique Appl."},{"key":"10.1016\/0304-3975(94)90254-2_BIB10","article-title":"Combinatorics on Traces","volume":"Vol. 454","author":"Diekert","year":"1990"},{"key":"10.1016\/0304-3975(94)90254-2_BIB11","series-title":"Proc. 8th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'91)","first-page":"105","article-title":"On the concatenation of infinite traces","volume":"Vol. 480","author":"Diekert","year":"1991"},{"key":"10.1016\/0304-3975(94)90254-2_BIB12","series-title":"Proc. 16th Symp. on Mathematical Foundations of Computer Science (MFCS'91)","first-page":"131","article-title":"Recognizable complex trace languages","volume":"Vol. 520","author":"Diekert","year":"1991"},{"key":"10.1016\/0304-3975(94)90254-2_BIB13","series-title":"Proc. 10th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'93)","first-page":"617","article-title":"Deterministic asynchronous automata for infinite traces","volume":"Vol. 665","author":"Diekert","year":"1992"},{"key":"10.1016\/0304-3975(94)90254-2_BIB14","series-title":"Proc. ASMICS Workshop on Infinite Traces","article-title":"On logical definability of \u03c9-trace languages","author":"Ebinger","year":"1992"},{"key":"10.1016\/0304-3975(94)90254-2_BIB15","series-title":"Automata, Languages and Machines, Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(94)90254-2_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90206-3","article-title":"Maximal serializability of iterated transactions","volume":"38","author":"Fl\u00e9","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90254-2_BIB17","first-page":"197","article-title":"Matrices de Hankel","volume":"53","author":"Fliess","year":"1974","journal-title":"J. Math. Pures Appl."},{"key":"10.1016\/0304-3975(94)90254-2_BIB18","series-title":"Ph.D. Thesis","article-title":"Un mod\u00e8le distribu\u00e9","author":"Gastin","year":"1987"},{"key":"10.1016\/0304-3975(94)90254-2_BIB19","series-title":"Proc. Spring School of Theoretical Computer Science on Semantics of Systems of Concurrent Processes","first-page":"277","article-title":"Infinite traces","volume":"Vol. 469","author":"Gastin","year":"1990"},{"key":"10.1016\/0304-3975(94)90254-2_BIB20","series-title":"Proc. 8th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'91)","first-page":"89","article-title":"Recognizable and rational languages of finite and infinite traces","volume":"Vol. 480","author":"Gastin","year":"1991"},{"key":"10.1016\/0304-3975(94)90254-2_BIB21","series-title":"Proc. 19th Internat. Coll. on Automata, Languages and Programming (ICALP '92)","first-page":"583","article-title":"Asynchronous cellular automata for infinite traces","volume":"Vol. 623","author":"Gastin","year":"1992"},{"key":"10.1016\/0304-3975(94)90254-2_BIB22","series-title":"Proc. 18th Internat. Coll. on Automata, Languages and Programming (ICALP '91)","first-page":"254","article-title":"A Kleene theorem for infinite trace languages","volume":"Vol. 510","author":"Gastin","year":"1991"},{"key":"10.1016\/0304-3975(94)90254-2_BIB23","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0304-3975(93)90247-Q","article-title":"The poset of infinitary traces","volume":"120","author":"Gastin","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90254-2_BIB24","series-title":"Ramsey Theory","author":"Graham","year":"1980"},{"key":"10.1016\/0304-3975(94)90254-2_BIB25","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0304-3975(91)90019-X","article-title":"Recognizable closures and submonoids of free partially commutative monoids","volume":"86","author":"Hashigushi","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90254-2_BIB26","series-title":"Ph.D. Thesis","article-title":"Fairness for non-interleaving concurrency","author":"Kwiatkowska","year":"1989"},{"key":"10.1016\/0304-3975(94)90254-2_BIB27","series-title":"Proc. 16th Coll. on Trees in Algebra and Programming (CAAP '91)","first-page":"42","article-title":"On the domain of traces and sequential composition","volume":"Vol. 493","author":"Kwiatkowska","year":"1991"},{"key":"10.1016\/0304-3975(94)90254-2_BIB28","series-title":"Tech. Report DAIMI PB 78","article-title":"Concurrent program schemes and their interpretations","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/0304-3975(94)90254-2_BIB29","series-title":"Proc. 11th Symp. on Mathematical Foundations of Computer Science (MFCS '84)","first-page":"115","article-title":"Traces, histories, graphs: instances of a process monoid","volume":"Vol. 176","author":"Mazurkiewicz","year":"1984"},{"key":"10.1016\/0304-3975(94)90254-2_BIB30","series-title":"Advances in Petri Nets '86","first-page":"279","article-title":"Trace theory","volume":"Vol. 255","author":"Mazurkiewicz","year":"1987"},{"key":"10.1016\/0304-3975(94)90254-2_BIB31","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(88)90027-8","article-title":"On recognizable subsets of free partially commutative monoids","volume":"58","author":"M\u00e9tivier","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(94)90254-2_BIB32","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1142\/S0129054191000169","article-title":"On the star operation in free partially commutative monoids","volume":"2","author":"M\u00e9tivier","year":"1991","journal-title":"Internat. J. Foundations Comput. Sci."},{"key":"10.1016\/0304-3975(94)90254-2_BIB33","first-page":"56","article-title":"Regular behaviour of concurrent systems","volume":"27","author":"Ochma\u0144ski","year":"1985","journal-title":"Bull. European Assoc. Theoret. Comput. Sci. (EATCS)"},{"key":"10.1016\/0304-3975(94)90254-2_BIB34","first-page":"252","article-title":"Notes on a star mystery","volume":"40","author":"Ochma\u0144ski","year":"1990","journal-title":"Bull. European Assoc. Theoret. Comput. Sci. (EATCS)"},{"key":"10.1016\/0304-3975(94)90254-2_BIB35","series-title":"Proc. Spring School of Theoretical Computer Science on Automata on Infinite Words","first-page":"2","article-title":"An introduction to finite automata on infinite words","volume":"Vol. 192","author":"Perrin","year":"1984"},{"key":"10.1016\/0304-3975(94)90254-2_BIB36","series-title":"Proc. 16th Internat. Coll. on Automata, Languages and Programming (ICALP '89)","first-page":"637","article-title":"Partial commutations","volume":"Vol. 372","author":"Perrin","year":"1989"},{"key":"10.1016\/0304-3975(94)90254-2_BIB37","series-title":"Tech. Report, LITP 91.06","article-title":"Mots infinis","author":"Perrin","year":"1991"},{"key":"10.1016\/0304-3975(94)90254-2_BIB38","series-title":"Automata, Languages and Programming","first-page":"103","article-title":"A propos des relations rationnelles fonctionnelles","author":"Sch\u00fctzenberger","year":"1972"},{"key":"10.1016\/0304-3975(94)90254-2_BIB39","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","article-title":"Notes on finite asynchronous automata","volume":"21","author":"Zielonka","year":"1987","journal-title":"RAIRO Inform. Th\u00e9orique Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902542?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:58:43Z","timestamp":1555077523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0304397594902542"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90254-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}