Advertisement

Asynchronous cellular automata for infinite traces

  • Paul Gastin
  • Antoine Petit
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 623)

Abstract

The notion of infinite traces has been proposed to generalize both the finite traces defined by Mazurkicwicz and the infinite words. The family of recognizable languages of infinite traces has been introduced by means of recognizing morphisms and characterized by c-rational expressions. In this paper, we provide another characterization of this family using asynchronous cellular automata (which carry the most intuitive idea of finite suite concurrent machines). To this purpose, we give effective constructions for c-rational operations on these automata, which are of independent interest.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AR88]
    I.J. AALBERSBERG and G. ROZENBERG, “Theory of traces”, Theoretical Computer Science 60, p. 1–82, 1988.CrossRefGoogle Scholar
  2. [Ber79]
    J. BERSTEL, “Transductions and context free languages”, Teubner Studienbucher Informatik, 1979.Google Scholar
  3. [BMP89]
    P. BONIZZONI, G. MAURI and G. PIGHIZZINI, “About infinite traces”, Proceedings of the ASMICS Workshop on Partially Commutative Monoids, Tech. Rep. TUM-I9002, Technische Universität München, 1989.Google Scholar
  4. [CMZ89]
    R. CORI, Y. METIVIER and W. ZIELONKA, “Asynchronous mappings and asynchronous cellular automata”, Tech. Rep. 89-97, LaBRI, Université de Bordeaux, France, 1989.Google Scholar
  5. [Die90]
    V. DIEKERT, “Combinatorics on traces”, Lecture Notes in Computer Science 454, 1990.Google Scholar
  6. [Die91]
    V. DIEKERT, “On the concatenation of infinite traces”, STACS'91, Lecture Notes in Computer Science 480, p. 105–117, 1991.Google Scholar
  7. [DGP91]
    V. DIEKERT, P. GASTIN, A. PETIT, “Recognizable complex trace languages”, MFCS'91, Lecture Notes in Computer Science 520, p. 131–140, 1991.Google Scholar
  8. [Eil74]
    S. EILENBERG, “Automata, Languages and Machines”, Academic Press, New York, 1974.Google Scholar
  9. [Gas90]
    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
  10. [Gas91]
    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
  11. [GP91]
    P. GASTIN and A. PETIT, “Asynchronous automata for infinite traces”, Tech. rep. 91.68, LITP, Université Paris 6, France, 1991.Google Scholar
  12. [GPZ91]
    P. GASTIN, A. PETIT, W. ZIELONKA, “A Kleene theorem for infinite trace languages”, ICALP'91, Lecture Notes in Computer Science 510, p. 254–266, 1991.Google Scholar
  13. [GR91]
    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
  14. [Kwi90]
    M.Z. KWIATKOWSKA, “A metric for traces”, Information and Processing Letters 35, p. 129–135, 1990.Google Scholar
  15. [Maz77]
    A. MPAZURKIEWICZ, “Concurrent program Schemes and their interpretations”, Aarhus University, DAIMI Rep. PB 78, 1977.Google Scholar
  16. [Maz86]
    A. MAZURKIEWICZ, “Trace theory”, Advanced Course on Petri Nets, Lecture Notes in Computer Science 255, p. 279–324, 1986.Google Scholar
  17. [Och85]
    E. OCHMANSKI, “Regular behaviour of concurrent systems”, Bulletin of EATCS 27, p. 56–67, October 1985.Google Scholar
  18. [Per89]
    D. PERRIN, “Partial commutations”, ICALP'89, Lecture Notes in Computer Science 372, p. 637–651, 1989.Google Scholar
  19. [PP91]
    D. PERRIN and J.E. PIN, “Mots Infinis”, Tech. Rep. 91-06, LITP, Université Paris 6, France, 1991. Book to appear.Google Scholar
  20. [Pig92]
    G. PIGHIZZINI, “On the iteration of trace languages”, Proceed. of the ASMICS Workshop on Infinite Traces, to appear as Tech. Rep., Universität Stuttgart, 1992.Google Scholar
  21. [Tho89]
    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, p. 172–182, 1989.Google Scholar
  22. [Tho90]
    W. THOMAS, “Automata on infinite objects”, Handbook of Theoretical Computer Science (J.V. Leeuwen, Ed.), Elsevier, Amsterdam, Vol. B, p. 135–191, 1990.Google Scholar
  23. [Tho91]
    W. THOMAS, “On logics, tilings, and automata”, ICALP'91, Lecture Notes in Computer Science 510, p. 441–454, 1991.Google Scholar
  24. [Zie87]
    W. ZIELONKA, “Notes on finite asynchronous automata and trace languages”, RAIRO Theoretical Informatics and Applications 21, p. 99–135, 1987.Google Scholar
  25. [Zi 89]
    W. ZIELONKA, “Safe execution of recognizable trace languages by asynchronous automata”, Lecture Notes in Computer Science 363, p. 278–289, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Paul Gastin
    • 1
  • Antoine Petit
    • 2
  1. 1.Institut Blaise PascalUniversité PARIS 6 LITPParis Cedex 05France
  2. 2.Université PARIS SUD LRI, URA CNRS 410Orsay CedexFrance

Personalised recommendations