Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1991: Automata, Languages and Programming pp 254–266Cite as

A Kleene theorem for infinite trace languages

  • Formal Languages (Session 6)
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 510))

Abstract

Kleene's theorem is considered as one of the cornerstones of theoretical computer science. It ensures that, for languages of finite words, the family of recognizable languages is equal to the family of rational languages. It has been generalized in various ways, for instance, to formal power series by Schützenberger, to infinite words by Büchi and to finite traces by Ochmanski. Finite traces have been introduced by Mazurkiewicz in order to modelize the behaviours of distributed systems. The family of recognizable trace languages is not closed by Kleene's star but by a concurrent version of this iteration. This leads to the natural definition of co-rational languages obtained as the rational one by simply replacing the Kleene's iteration by the concurrent iteration. Cori, Perrin and Métivier proved, in substance, that any co-rational trace language is recognizable. Independently,Ochmanski generalized Kleene's theorem showing that the recognizable trace languages are exactly the co-rational languages. Besides, infinite traces have been recently introduced as a natural extension of both finite traces and infinite words. In this paper we generalize Kleene's theorem to languages of infinite traces proving that the recognizable languages of finite or infinite traces are exactly the co-rational languages.

This work has been partly supported by the ESPRIT Basic Research Actions No 3166 (ASMICS) and No 3148 (DEMON) and by the PRC Math-Info.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. I.J. AALBERSBERG and G. ROZENBERG, “Theory of traces”, Theoretical Computer Science 60, p. 1–82, 1988.

    Google Scholar 

  2. P. BONIZZONI, G. MAURI and G. PIGHIZZINI, “About infinite traces”, Proceedings of the ASMICS Workshop on Partially Commutative Monoids, Tech. Rep. TUM-I 9002, Technische Universität München, 1989.

    Google Scholar 

  3. J.R. BUCHI, “On a decision method in restricted second order arithmetic”, Proc. Internat. Congress on Logic, Methodology and Philosophy (Standford University Press), p. 1–11, 1962.

    Google Scholar 

  4. P. CARTIER and D. FOATA, “Problèmes combinatoires de commutation et réarrangements”, Lecture Notes in Math. 85, 1969.

    Google Scholar 

  5. M. CLERBOUT and M. LATTEUX, “Semi-commutations”, Information and Computation 73, 1987.

    Google Scholar 

  6. R. CORI and Y. METIVIER, “Recognizable subsets of some partially abelian monoids”, Theoretical Computer Science 35, p. 179–189, 1985.

    Google Scholar 

  7. R. CORI, Y. METIVIER and W. ZIELONKA, “Asynchronous mappings and asynchronous cellular automata”, Tech. Rep. 89–97, LaBRI, Université de Bordeaux, France, 1990.

    Google Scholar 

  8. R. CORI and D. PERRIN, “Automates et commutations partielles”, RAIRO Theoretical Informatics and Applications 19, p. 21–32, 1985.

    Google Scholar 

  9. V. DIEKERT, “Combinatorics on traces”, Lecture Notes in Computer Science 454, 1990.

    Google Scholar 

  10. V. DIEKERT, “On the concatenation of infinite traces”, STACS'91, Lecture Notes in Computer Science 480, p. 105–117, 1991.

    Google Scholar 

  11. C. DUBOC, “Commutations dans les monoïdes libres: un cadre théorique pour l'étude du parallélisme”, Thèse, Université de Rouen, France, 1986.

    Google Scholar 

  12. S. EILENBERG, “Automata, Languages and Machines”, Academic Press, New York, 1974.

    Google Scholar 

  13. M. FLIESS, “Matrices de Hankel”, J. Math. pures et appl. 53, p. 197–224, 1974.

    Google Scholar 

  14. M.P. FLE and G. ROUCAIROL, “Maximal serializability of iterated transactions”, Theoretical Computer Science 38, p. 1–16, 1985.

    Google Scholar 

  15. P. GASTIN, “Un modèle asynchrone pour les systèmes distribués”, Theoretical Computer Science 74, p. 121–162, 1990.

    Google Scholar 

  16. P. GASTIN, “Infinite traces”, Proceedings of the Spring School of Theoretical Computer Science on “Semantics of concurrency”, Lecture Notes in Computer Science 469, p. 277–308, 1990.

    Google Scholar 

  17. P. GASTIN, “Recognizable and rational languages of finite and infinite traces”, STACS'91, Lecture Notes in Computer Science 480, p. 89–104, 1991.

    Google Scholar 

  18. R. L. GRAHAM, “Rudiments of Ramsey theory”, Regional conference series in mathematics 45, 1981.

    Google Scholar 

  19. P. GASTIN and B.ROZOY, “The Poset of infinitary traces”, to appear in Theoretical Computer Science, Tech. Rep. 91-07, LITP, Université Paris 6, France, 1991.

    Google Scholar 

  20. H.J. HOOGEBOOM and G. ROZENBERG, “Infinitary languages: basic theory and applications to concurrent systems”, Lecture Notes in Computer Science 224, p. 266–342, 1986.

    Google Scholar 

  21. M.Z. KWIATKOWSKA, “On infinitary trace languages”, Tech. Rep. 31, University of Leicester, England, 1989.

    Google Scholar 

  22. A. MAZURKIEWICZ, “Concurrent program Schemes and their interpretations”, Aarhus University, DAIMI Rep. PB 78, 1977.

    Google Scholar 

  23. A. MAZURKIEWICZ, “Trace theory”, Advanced Course on Petri Nets, Lecture Notes in Computer Science 255, p. 279–324, 1986.

    Google Scholar 

  24. Y. METIVIER, “Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif”, RAIRO Theoretical Informatics and Applications 20, p. 121–127, 1986.

    Google Scholar 

  25. Y. METIVIER, “On recognizable subsets in free partially commutative monoids”, ICALP 1986, Lecture Notes in Computer Science 226, p. 254–264, 1986.

    Google Scholar 

  26. Y. METIVIER and B. ROZOY, “On the star operation in free partially commutative monoids”, Tech. Rep. 625, LRI, Université de Paris Sud, France, 1991.

    Google Scholar 

  27. D.E. MULLER, “Infinite sequences and finite machines”, Proc. 4th IEEE Ann. Symp. on Switching Circuit Theory and Logical Design, p. 3–16, 1963.

    Google Scholar 

  28. E. OCHMANSKI, “Regular behaviour of concurrent systems”, Bulletin of EATCS 27, p. 56–67, October 1985.

    Google Scholar 

  29. E. OCHMANSKI, “Notes on a star mystery”, Bulletin of EATCS 40, p. 252–257, February 1990.

    Google Scholar 

  30. D. PERRIN, “Recent results on automata and infinite words”, Lecture Notes in Computer Science 176, p. 134–148, 1984.

    Google Scholar 

  31. D. PERRIN, “Partial commutations”, ICALP 89, Lecture Notes in Computer Science 372, p. 637–651, 1989.

    Google Scholar 

  32. D.PERRIN and J.E. PIN, “Mots Infinis”, Book to appear, Tech. Rep. 91-06, LITP, Université Paris 6, France, 1991.

    Google Scholar 

  33. B. ROZOY, “On Traces, Partial Order Sets and Recognizability”, ISCIS V, Cappadocia, Turkey, proceedings to appear, 1990.

    Google Scholar 

  34. J. SAKAROVITCH, “On regular trace languages”, Theoretical Computer Science 52, p. 59–75, 1987.

    Google Scholar 

  35. W. THOMAS, “Automata on infinite objects”, to appear in Handbook of Theoretical Computer Science (J.V. Leeuwen, Ed.), North-Holland, Amsterdam.

    Google Scholar 

  36. W. THOMAS, “On logical definability of trace languages”, Proceedings of the ASMICS Workshop on Partially Commutative Monoids, Tech. Rep. TUM-I 9002, Technische Universität München, 1989.

    Google Scholar 

  37. W. ZIELONKA, “Notes on finite asynchronous automata and trace languages”, RAIRO Theoretical Informatics and Applications 21, p. 99–135, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP, Institut Blaise Pascal, Université PARIS 6, 4, place Jussieu, 75 252, Paris Cedex 05, France

    Paul Gastin

  2. LRI, URA CNRS 410, Université PARIS SUD, Bât. 490, 91 405, Orsay Cedex, France

    Antoine Petit

  3. LaBRI, Université BORDEAUX 1, 351, Cours de la Libération, 33 405, Talence Cedex, France

    Wieslaw Zielonka

Authors
  1. Paul Gastin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antoine Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wieslaw Zielonka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gastin, P., Petit, A., Zielonka, W. (1991). A Kleene theorem for infinite trace languages. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_139

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_139

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation