Advertisement

A survey of recognizable languages of infinite traces

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

Abstract

A. Mazurkiewicz [Maz77] defined traces in order to represent non-sequential processes. In order to describe non-sequential processes which never terminate, e.g. distributed operating systems, the notion of infinite traces is needed. The aim of this survey is to present in a uniform way the results on recognizable infinite trace languages stated in [Gas91], [GPZ91] and [DGP91]. The proofs of the presented results are not proposed here but can be found in the original papers.

Keywords

Semantics of concurrent processes Infinite traces Recognizable languages 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Arn85]
    A. ARNOLD, “A syntactic congruence for rational Ω-languages”, Theoretical Computer Science 39, p. 333–335, 1985.Google Scholar
  2. [AR88]
    I.J. AALBERSBERG and G. ROZENBERG, “Theory of traces”, Theoretical Computer Science 60, p. 1–82, 1988.Google Scholar
  3. [BD87]
    E. BEST and R. DEVILLERS, “Sequential and concurrent behaviour in Petri Net theory”, Theoretical Computer Science 55, p. 87–136, 1987.Google Scholar
  4. [BMP89]
    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, p. 1–10, 1989.Google Scholar
  5. [CF69]
    P. CARTIER and D. FOATA, “Problèmes combinatoires de commutation et réarrangements”, Lecture Notes in Mathematics 85, 1969.Google Scholar
  6. [CM85]
    R. CORI and Y. METIVIER, “Recognizable subsets of some partially abelian monoids”, Theoretical Computer Science 35, p. 179–189, 1985.Google Scholar
  7. [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
  8. [CP85]
    R. CORI and D. PERRIN, “Automates et commutations partielles”, RAIRO Theoretical Informatics and Applications 19, p. 21–32, 1985.Google Scholar
  9. [DGP91]
    V. DIEKERT, P. GASTIN, A. PETIT, “Recognizable complex trace languages”, MFCS'91, Lecture Notes in Computer Science 520, p. 131–140, 1991. Also available as Technical Report, LRI, Université de Paris-Sud, France.Google Scholar
  10. [Die90]
    V. DIEKERT, “Combinatorics on traces”, Lecture Notes in Computer Science 454, 1990.Google Scholar
  11. [Die91]
    V. DIEKERT, “On the concatenation of infinite traces”, STACS'91, Lecture Notes in Computer Science 480, p. 105–117, 1991.Google Scholar
  12. [Ebi92]
    W. EBINGER, “On logical definability of infinite trace languages”, Proceedings of the ASMICS Workshop on Infinite Traces, to appear as Tech. Rep., Universität Stuttgart, 1992.Google Scholar
  13. [Eil74]
    S. EILENBERG, “Automata, Languages and Machines”, Academic Press, New York, 1974.Google Scholar
  14. [Fli74]
    M. FLIESS, “Matrices de Hankel”, J. Math. pures et appl. 53, p. 197–224, 1974.Google Scholar
  15. [FR85]
    M.P. FLE and G. ROUCAIROL, “Maximal serializability of iterated transactions”, Theoretical Computer Science 38, p. 1–16, 1985.Google Scholar
  16. [Gas90a]
    P. GASTIN, “Un modèle asynchrone pour les systèmes distribués”, Theoretical Computer Science 74, p. 121–162, 1990.Google Scholar
  17. [Gas90b]
    P. GASTIN, “Infinite traces”, Proceedings of the Spring School of Theoretical Computer Science on “Semantics of concurrency”, Lecture Notes in Computer Science 469, 1990.Google Scholar
  18. [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
  19. [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. Also available as Technical Report, LRI, Université de Paris-Sud, France.Google Scholar
  20. [GP92]
    P. GASTIN and A. PETIT, “Asynchronous cellular automata for infinite traces”, ICALP'92, Proceedings to appear in Lecture Notes in Computer Science. Also available as Tech. Rep. 91-68, LITP, Université Paris 6, France, 1991.Google Scholar
  21. [Gra81]
    R. L. GRAHAM, “Rudiments of Ramsey theory “, Regional conference series in mathematics 45, 1981.Google Scholar
  22. [GR91]
    P. GASTIN and B. ROZOY, “The Poset of infinitary traces”, to appear in Theoretical Computer Science, also available as Technical Report 91-07, LITP, Université Paris 6, France, 1991.Google Scholar
  23. [Kwi90]
    M.Z. KWIATKOWSKA, “A metric for traces”, Information and Processing Letters 35, p. 129–135, 1990.Google Scholar
  24. [Kwi91]
    M.Z. KWIATKOWSKA, “On the domain of traces and sequential composition”, CAAP'91, Lecture Notes in Computer Science 493, p. 42–56, 1991.Google Scholar
  25. [Maz77]
    A. MAZURKIEWICZ, “Concurrent program Schemes and their interpretations”, Aarhus University, DAIMI Rep. PB 78, 1977.Google Scholar
  26. [Maz86]
    A. MAZURKIEWICZ, “Trace theory”, Advanced Course on Petri Nets, Lecture Notes in Computer Science 255, p. 279–324, 1986.Google Scholar
  27. [Mét86]
    Y. METIVIER, “On recognizable subsets in free partially commutative monoids”, ICALP'86, Lecture Notes in Computer Science 226, p. 254–264, 1986.Google Scholar
  28. [MR91]
    Y. METIVIER and B. ROZOY, “On the star operation in free partially commutative monoid”, to appear in International Journal of Foundations of Computer Science, also available as Technical Report, Université de Paris-Sud, France, January 1991.Google Scholar
  29. [Och85]
    E. OCHMANSKI, “Regular behaviour of concurrent systems”, Bulletin of EATCS 27, p. 56–67, October 1985.Google Scholar
  30. [Och90]
    E. OCHMANSKI, “Notes on a star mystery”, Bulletin of EATCS 40, p. 252–257, February 1990.Google Scholar
  31. [Per89]
    D. PERRIN, “Partial commutations”, ICALP'89, Lecture Notes in Computer Science 372, p. 637–651, 1989.Google Scholar
  32. [PP91]
    D. PERRIN and J.E. PIN, “Mots Infinis”, Tech. Rep. 91-06, LITP, Université Paris 6, France, 1991. Book to appear.Google Scholar
  33. [Roz90]
    B. ROZOY, “On Traces, Partial Order Sets and Recognizability”, Proceedings of ISCIS V, Cappadocia, Turkey, 1990.Google Scholar
  34. [Sak87]
    J. SAKAROVITCH, “On regular trace languages”, Theoretical Computer Science 52, p. 59–75, 1987.Google Scholar
  35. [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
  36. [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
  37. [Zie87]
    W. ZIELONKA, “Notes on finite asynchronous automata and trace languages”, RAIRO Theoretical Informatics and Applications 21, p. 99–135, 1987.Google Scholar
  38. [Zie89]
    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.LITP, Institut Blaise PascalUniversité PARIS 6Paris Cedex 05France
  2. 2.LRI, URA CNRS 410Université PARIS SUDOrsay CedexFrance

Personalised recommendations