{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:59:25Z","timestamp":1781017165273,"version":"3.54.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1007\/bf01178512","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T11:58:01Z","timestamp":1108641481000},"page":"379-397","source":"Crossref","is-referenced-by-count":18,"title":["Deterministic asynchronous automata for infinite traces"],"prefix":"10.1007","volume":"31","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","volume":"39","author":"A. Arnold","year":"1985","unstructured":"[Arn85] Arnold, A.: A syntactic congruence for rational ?-languages. Theoret. Comput. Sci.39, 333?335 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"CR2","series-title":"Lect. Notes Math.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0079468","volume-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements","author":"P. Cartier","year":"1969","unstructured":"[CF69] Cartier, P., Foata, D.: Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. (Lect. Notes Math., vol. 85) Berlin, Heidelberg, New York: Springer 1969"},{"key":"CR3","unstructured":"[CMZ89] Cori, R., M\u00e9tivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Tech. rep. 89-97, LABRI, Univ. Bordeaux, 1989"},{"key":"CR4","first-page":"21","volume":"19","author":"R. Cori","year":"1985","unstructured":"[CP85] Cori, R., Perrin, D.: Automates et commutations partielles. R.A.I.R.O.?Inf. Th\u00e9or. Appl.19, 21?32 (1985)","journal-title":"R.A.I.R.O.?Inf. Th\u00e9or. Appl."},{"key":"CR5","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53031-2","volume-title":"Combinatorics on traces","author":"V. Diekert","year":"1990","unstructured":"[Die90] Diekert, V.: Combinatorics on traces. (Lect. Notes Comput. Sci., vol. 454) Berlin, Heidelberg, New York: Springer 1990"},{"key":"CR6","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BFb0020791","volume-title":"Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), Hamburg 1991","author":"V. Diekert","year":"1991","unstructured":"[Die91] Diekert, V.: On the concatenation of infinite traces. In: Choffrut C. et al. (eds.) Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), Hamburg 1991 (Lect. Notes Comput. Sci., vol. 480, pp. 105?117) Berlin, Heidelberg, New York: Springer 1991. Also in Theoret. Comput. Sci.113, 35?54 (1993)"},{"key":"CR7","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BFb0020790","volume-title":"Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), Hamburg 1991","author":"P. Gastin","year":"1991","unstructured":"[Gas91] Gastin, P.: Recognizable and rational trace languages of finite and infinite traces. In: Choffrut C. et al. (eds.) Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), Hamburg 1991 (Lect. Notes Comput. Sci., vol. 480, pp. 89?104) Berlin, Heidelberg, New York: Springer 1991"},{"key":"CR8","series-title":"Lect. Notes Comput. Sci.","volume-title":"Proceedings of the 19th International Colloquium on Automata Languages and Programming (ICALP'92), Vienna (Austria) 1992","author":"P. Gastin","year":"1992","unstructured":"[GP92] Gastin, P., Petit, A.: Asynchronous cellular automata for infinite traces. In: W. Kuich (ed.) Proceedings of the 19th International Colloquium on Automata Languages and Programming (ICALP'92), Vienna (Austria) 1992 (Lect. Notes Comput. Sci., vol. 623) Berlin, Heidelberg, New York: Springer 1992 Also available as Tech. Rep. 91-68, LITP, Universit\u00e9 Paris 6, France, 1991"},{"key":"CR9","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/3-540-54233-7_139","volume-title":"Proceedings of the 18th International Colloquium on Automata Languages and Programming (ICALP'91), Madrid (Spain) 1991","author":"P. Gastin","year":"1991","unstructured":"[GPZ91] Gastin, P., Petit, A., Zielonka, W.: A Kleene theorem for infinite trace languages, In: Albert J.L. et al. (eds.) Proceedings of the 18th International Colloquium on Automata Languages and Programming (ICALP'91), Madrid (Spain) 1991 (Lect. Notes Comput. Sci., vol. 510, pp. 254?266) Berlin, Heidelberg, New York: Springer 1991"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"[GR91] Gastin, P., Rozoy, B.: The poset of infinitary traces. Tech. Rep. LITP 91.07, Universit\u00e9 Paris 6 (France), 1991. Also in Theoret. Comput. Sci.120, 101?121 (1993)","DOI":"10.1016\/0304-3975(93)90247-Q"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0020-0190(90)90061-2","volume":"35","author":"M. Kwiatkowska","year":"1990","unstructured":"[Kwi90] Kwiatkowska, M.: A metric for traces. Inf. Process. Lett.35, 129?135 (1990)","journal-title":"Inf. Process. Lett."},{"key":"CR12","volume-title":"Concurrent program schemes and their interpretations","author":"A. Mazurkiewicz","year":"1977","unstructured":"[Maz77] Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977"},{"key":"CR13","series-title":"Lect. Notes Comput. Sci.","first-page":"279","volume-title":"Petri Nets, Applications and Relationship to other Models of Concurrency","author":"A. Mazurkiewicz","year":"1987","unstructured":"[Maz87] Mazurkiewicz, A.: Trace theory. In: Brauer, W. et al. (eds.) Petri Nets, Applications and Relationship to other Models of Concurrency (Lect. Notes Comput. Sci., vol. 255, pp. 279?324) Berlin, Heidelberg, New York: Springer 1987"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"[McN66] McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inf. Control9, 521?530 (1966)","journal-title":"Inf. Control"},{"key":"CR15","unstructured":"[PP91] Perrin, D., Pin, J.E.: Mots Infinis. Tech. Rep. LITP 91.06, Universit\u00e9 Paris 6 (France), 1992 (Book to appear)"},{"key":"CR16","first-page":"133","volume-title":"Handbook of theoretical computer science","author":"W. Thomas","year":"1990","unstructured":"[Tho90] Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of theoretical computer science, pp. 133?191. Amsterdam: Elsevier 1990"},{"key":"CR17","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"[Zie87] Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O.?Inf. Th\u00e9or. Appl.21, 99?135 (1987)","journal-title":"R.A.I.R.O.?Inf. Th\u00e9or. Appl."},{"key":"CR18","series-title":"Lect. Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-51237-3_22","volume-title":"Proceedings Symposium on Logical Foundations of Computer Science, Logic at Botik '89, Pereslavl-Zalessky (USSR) 1989","author":"W. Zielonka","year":"1989","unstructured":"[Zie89] Zielonka, W.: Safe executions of recognizable trace languages by asynchronous automata. In: Mayer A.R. et al. (eds.) Proceedings Symposium on Logical Foundations of Computer Science, Logic at Botik '89, Pereslavl-Zalessky (USSR) 1989 (Lect. Notes Comput. Sci., vol. 363, pp. 278?289) Berlin, Heidelberg, New York: Springer 1989"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178512.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01178512\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T09:07:50Z","timestamp":1556615270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01178512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["BF01178512"],"URL":"https:\/\/doi.org\/10.1007\/bf01178512","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}