{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:19Z","timestamp":1725663379187},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_139","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:37:15Z","timestamp":1330209435000},"page":"254-266","source":"Crossref","is-referenced-by-count":7,"title":["A Kleene theorem for infinite trace languages"],"prefix":"10.1007","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":"Wieslaw","family":"Zielonka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I.J. Aalbersberg","year":"1988","unstructured":"I.J. AALBERSBERG and G. ROZENBERG, \u201cTheory of traces\u201d, Theoretical Computer Science 60, p. 1\u201382, 1988.","journal-title":"Theoretical Computer Science"},{"unstructured":"P. BONIZZONI, G. MAURI and G. PIGHIZZINI, \u201cAbout infinite traces\u201d, Proceedings of the ASMICS Workshop on Partially Commutative Monoids, Tech. Rep. TUM-I 9002, Technische Universit\u00e4t M\u00fcnchen, 1989.","key":"19_CR2"},{"unstructured":"J.R. BUCHI, \u201cOn a decision method in restricted second order arithmetic\u201d, Proc. Internat. Congress on Logic, Methodology and Philosophy (Standford University Press), p. 1\u201311, 1962.","key":"19_CR3"},{"doi-asserted-by":"crossref","unstructured":"P. CARTIER and D. FOATA, \u201cProbl\u00e8mes combinatoires de commutation et r\u00e9arrangements\u201d, Lecture Notes in Math. 85, 1969.","key":"19_CR4","DOI":"10.1007\/BFb0079468"},{"doi-asserted-by":"crossref","unstructured":"M. CLERBOUT and M. LATTEUX, \u201cSemi-commutations\u201d, Information and Computation 73, 1987.","key":"19_CR5","DOI":"10.1016\/0890-5401(87)90040-X"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0304-3975(85)90013-1","volume":"35","author":"R. Cori","year":"1985","unstructured":"R. CORI and Y. METIVIER, \u201cRecognizable subsets of some partially abelian monoids\u201d, Theoretical Computer Science 35, p. 179\u2013189, 1985.","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","volume-title":"Asynchronous mappings and asynchronous cellular automata","author":"R. Cori","year":"1990","unstructured":"R. CORI, Y. METIVIER and W. ZIELONKA, \u201cAsynchronous mappings and asynchronous cellular automata\u201d, Tech. Rep. 89\u201397, LaBRI, Universit\u00e9 de Bordeaux, France, 1990."},{"key":"19_CR8","first-page":"21","volume":"19","author":"R. Cori","year":"1985","unstructured":"R. CORI and D. PERRIN, \u201cAutomates et commutations partielles\u201d, RAIRO Theoretical Informatics and Applications 19, p. 21\u201332, 1985.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"doi-asserted-by":"crossref","unstructured":"V. DIEKERT, \u201cCombinatorics on traces\u201d, Lecture Notes in Computer Science 454, 1990.","key":"19_CR9","DOI":"10.1007\/3-540-53031-2"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BFb0020791","volume":"480","author":"V. Diekert","year":"1991","unstructured":"V. DIEKERT, \u201cOn the concatenation of infinite traces\u201d, STACS'91, Lecture Notes in Computer Science 480, p. 105\u2013117, 1991.","journal-title":"STACS'91, Lecture Notes in Computer Science"},{"key":"19_CR11","volume-title":"Commutations dans les mono\u00efdes libres: un cadre th\u00e9orique pour l'\u00e9tude du parall\u00e9lisme","author":"C. Duboc","year":"1986","unstructured":"C. DUBOC, \u201cCommutations dans les mono\u00efdes libres: un cadre th\u00e9orique pour l'\u00e9tude du parall\u00e9lisme\u201d, Th\u00e8se, Universit\u00e9 de Rouen, France, 1986."},{"key":"19_CR12","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"S. EILENBERG, \u201cAutomata, Languages and Machines\u201d, Academic Press, New York, 1974."},{"key":"19_CR13","first-page":"197","volume":"53","author":"M. Fliess","year":"1974","unstructured":"M. FLIESS, \u201cMatrices de Hankel\u201d, J. Math. pures et appl. 53, p. 197\u2013224, 1974.","journal-title":"J. Math. pures et appl."},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(85)90206-3","volume":"38","author":"M.P. Fle","year":"1985","unstructured":"M.P. FLE and G. ROUCAIROL, \u201cMaximal serializability of iterated transactions\u201d, Theoretical Computer Science 38, p. 1\u201316, 1985.","journal-title":"Theoretical Computer Science"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(90)90134-4","volume":"74","author":"P. Gastin","year":"1990","unstructured":"P. GASTIN, \u201cUn mod\u00e8le asynchrone pour les syst\u00e8mes distribu\u00e9s\u201d, Theoretical Computer Science 74, p. 121\u2013162, 1990.","journal-title":"Theoretical Computer Science"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-53479-2_12","volume":"469","author":"P. Gastin","year":"1990","unstructured":"P. GASTIN, \u201cInfinite traces\u201d, Proceedings of the Spring School of Theoretical Computer Science on \u201cSemantics of concurrency\u201d, Lecture Notes in Computer Science 469, p. 277\u2013308, 1990.","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0020790","volume":"480","author":"P. Gastin","year":"1991","unstructured":"P. GASTIN, \u201cRecognizable and rational languages of finite and infinite traces\u201d, STACS'91, Lecture Notes in Computer Science 480, p. 89\u2013104, 1991.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"R. L. GRAHAM, \u201cRudiments of Ramsey theory\u201d, Regional conference series in mathematics 45, 1981.","key":"19_CR18","DOI":"10.1090\/cbms\/045"},{"unstructured":"P. GASTIN and B.ROZOY, \u201cThe Poset of infinitary traces\u201d, to appear in Theoretical Computer Science, Tech. Rep. 91-07, LITP, Universit\u00e9 Paris 6, France, 1991.","key":"19_CR19"},{"key":"19_CR20","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/BFb0027043","volume":"224","author":"H.J. Hoogeboom","year":"1986","unstructured":"H.J. HOOGEBOOM and G. ROZENBERG, \u201cInfinitary languages: basic theory and applications to concurrent systems\u201d, Lecture Notes in Computer Science 224, p. 266\u2013342, 1986.","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR21","volume-title":"On infinitary trace languages","author":"M.Z. Kwiatkowska","year":"1989","unstructured":"M.Z. KWIATKOWSKA, \u201cOn infinitary trace languages\u201d, Tech. Rep. 31, University of Leicester, England, 1989."},{"doi-asserted-by":"crossref","unstructured":"A. MAZURKIEWICZ, \u201cConcurrent program Schemes and their interpretations\u201d, Aarhus University, DAIMI Rep. PB 78, 1977.","key":"19_CR22","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"19_CR23","first-page":"279","volume":"255","author":"A. Mazurkiewicz","year":"1986","unstructured":"A. MAZURKIEWICZ, \u201cTrace theory\u201d, Advanced Course on Petri Nets, Lecture Notes in Computer Science 255, p. 279\u2013324, 1986.","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR24","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1051\/ita\/1986200201211","volume":"20","author":"Y. Metivier","year":"1986","unstructured":"Y. METIVIER, \u201cUne condition suffisante de reconnaissabilit\u00e9 dans un mono\u00efde partiellement commutatif\u201d, RAIRO Theoretical Informatics and Applications 20, p. 121\u2013127, 1986.","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"19_CR25","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/3-540-16761-7_75","volume":"226","author":"Y. Metivier","year":"1986","unstructured":"Y. METIVIER, \u201cOn recognizable subsets in free partially commutative monoids\u201d, ICALP 1986, Lecture Notes in Computer Science 226, p. 254\u2013264, 1986.","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR26","volume-title":"On the star operation in free partially commutative monoids","author":"Y. Metivier","year":"1991","unstructured":"Y. METIVIER and B. ROZOY, \u201cOn the star operation in free partially commutative monoids\u201d, Tech. Rep. 625, LRI, Universit\u00e9 de Paris Sud, France, 1991."},{"doi-asserted-by":"crossref","unstructured":"D.E. MULLER, \u201cInfinite sequences and finite machines\u201d, Proc. 4th IEEE Ann. Symp. on Switching Circuit Theory and Logical Design, p. 3\u201316, 1963.","key":"19_CR27","DOI":"10.1109\/SWCT.1963.8"},{"key":"19_CR28","first-page":"56","volume":"27","author":"E. Ochmanski","year":"1985","unstructured":"E. OCHMANSKI, \u201cRegular behaviour of concurrent systems\u201d, Bulletin of EATCS 27, p. 56\u201367, October 1985.","journal-title":"Bulletin of EATCS"},{"key":"19_CR29","first-page":"252","volume":"40","author":"E. Ochmanski","year":"1990","unstructured":"E. OCHMANSKI, \u201cNotes on a star mystery\u201d, Bulletin of EATCS 40, p. 252\u2013257, February 1990.","journal-title":"Bulletin of EATCS"},{"key":"19_CR30","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BFb0030294","volume":"176","author":"D. Perrin","year":"1984","unstructured":"D. PERRIN, \u201cRecent results on automata and infinite words\u201d, Lecture Notes in Computer Science 176, p. 134\u2013148, 1984.","journal-title":"Lecture Notes in Computer Science"},{"key":"19_CR31","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/BFb0035789","volume":"372","author":"D. Perrin","year":"1989","unstructured":"D. PERRIN, \u201cPartial commutations\u201d, ICALP 89, Lecture Notes in Computer Science 372, p. 637\u2013651, 1989.","journal-title":"Lecture Notes in Computer Science"},{"unstructured":"D.PERRIN and J.E. PIN, \u201cMots Infinis\u201d, Book to appear, Tech. Rep. 91-06, LITP, Universit\u00e9 Paris 6, France, 1991.","key":"19_CR32"},{"unstructured":"B. ROZOY, \u201cOn Traces, Partial Order Sets and Recognizability\u201d, ISCIS V, Cappadocia, Turkey, proceedings to appear, 1990.","key":"19_CR33"},{"key":"19_CR34","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(87)90080-6","volume":"52","author":"J. Sakarovitch","year":"1987","unstructured":"J. SAKAROVITCH, \u201cOn regular trace languages\u201d, Theoretical Computer Science 52, p. 59\u201375, 1987.","journal-title":"Theoretical Computer Science"},{"unstructured":"W. THOMAS, \u201cAutomata on infinite objects\u201d, to appear in Handbook of Theoretical Computer Science (J.V. Leeuwen, Ed.), North-Holland, Amsterdam.","key":"19_CR35"},{"unstructured":"W. THOMAS, \u201cOn logical definability of trace languages\u201d, Proceedings of the ASMICS Workshop on Partially Commutative Monoids, Tech. Rep. TUM-I 9002, Technische Universit\u00e4t M\u00fcnchen, 1989.","key":"19_CR36"},{"key":"19_CR37","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"W. ZIELONKA, \u201cNotes on finite asynchronous automata and trace languages\u201d, RAIRO Theoretical Informatics and Applications 21, p. 99\u2013135, 1987.","journal-title":"RAIRO Theoretical Informatics and Applications"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_139.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:11Z","timestamp":1605646391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_139","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}