Skip to main content
SpringerLink
Log in

Infinite traces

  • Conference paper
  • First Online:
Semantics of Systems of Concurrent Processes (LITP 1990)

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

Included in the following conference series:

Abstract

Trace languages are used in computer science to provide a description of the behaviours of concurrent systems. If we are interested in systems which never stop then we have to consider languages of infinite traces. In this paper, we generalize to infinite traces three well known points of view about finite traces: equivalence class of words, projections on the dependence cliques and dependence graphs. These approaches are complementary and, depending on the problem we deal with, each of them can prove to be more appropriate than the others. In this way, we obtain an infinitary trace monoid and extend Levi's lemma and the Foata normal form. Next, we prove that the infinitary trace monoid is a completely coherent PoSet. We also define an ultrametric distance and prove that it is a complete metric space. Therefore, either the PoSet or the topological framework can be used to solve fix-point equations and then to provide semantics of recursive constructs. Finally, we introduce recognizable languages of finite and infinite traces. We prove that they are characterized by a syntactic congruence and that the family of recognizable languages is closed by concatenation and by the Boolean operations: union, intersection and complement.

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. A. ARNOLD, “A syntactic congruence for rational ω-languages”, Theoretical Computer Science 39, p. 333–335, 1985.

    Google Scholar 

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

    Google Scholar 

  3. I.J. AALBERSBERG and E. WELZL, “Traces languages defined by regular string languages”, RAIRO Theoretical Informatics and Applications 20, p. 103–119, 1986.

    Google Scholar 

  4. A. BERTONI, G. MAURI and N. SABADINI, “Membership problem for regular and context-free trace languages”, Information and Computation 82, p. 135–150, 1989.

    Google Scholar 

  5. 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 

  6. 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 

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

    Google Scholar 

  8. C. CHOFFRUT, “Free partially commutative monoids”, Tech. Rep. 86-20, LITP, Université Paris 6, France, 1986.

    Google Scholar 

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

    Google Scholar 

  10. 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 

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

    Google Scholar 

  12. V. DIEKERT, “Combinatorics on traces”, to appear in Lecture Notes in Computer Science.

    Google Scholar 

  13. V. DIEKERT, “On the concatenation of infinite traces”, Tech. Rep. TUM, Technische Universität München, 1990.

    Google Scholar 

  14. 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 

  15. C. DUBOC, “Mixed product and asynchronous automata”, Theoretical Computer Science 48, p. 183–199, 1986.

    Google Scholar 

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

    Google Scholar 

  17. P. GASTIN, “Un modèle distribué”, Thèse, LITP, Université Paris 7, France, 1987.

    Google Scholar 

  18. P. GASTIN, “Un modèle asynchrone pour les systèmes distribués”, Tech. Rep. 88-59, LITP, Université Paris 6, France, 1988, to appear in T.C.S.

    Google Scholar 

  19. P. GASTIN, “Infinite traces — Recognizable sets of infinite traces”, Proceedings of the ASMICS Workshop on Partially Commutative Monoids, Tech. Rep. TUM-I 9002, Technische Universität München, 1989.

    Google Scholar 

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

    Google Scholar 

  21. P. GASTIN and B. ROZOY, “The Poset of infinitary traces”, Tech. Rep. 90-24, LITP, Université Paris 6, France, 1990.

    Google Scholar 

  22. 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 

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

    Google Scholar 

  24. M. LOTHAIRE, “Combinatorics on words”, Addison Wesley, 1983.

    Google Scholar 

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

    Google Scholar 

  26. A. MAZURKIEWICZ, “Trace, histories, graphs: instances of a process monoid”, Lecture Notes in Computer Science 176, p. 115–133, 1984.

    Google Scholar 

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

    Google Scholar 

  28. 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 

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

    Google Scholar 

  30. 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 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  34. D.PERRIN and J.E. PIN, “Mots Infinis”, Tech. Rep., LITP, Université Paris 6, France, 1990. Book to appear.

    Google Scholar 

  35. G. ROZENBERG, “Behaviour of elementary net systems”, Advanced Course on Petri Nets, Lecture Notes in Computer Science 254, p. 60–94, 1986.

    Google Scholar 

  36. B. ROZOY, “On the recognizability of X* in trace monoids”, Tech. Rep. 87-34, LITP, Université Paris 6, France, 1987.

    Google Scholar 

  37. B. ROZOY and P.S. THIAGARAJAN, “Trace monoids and event structures”, Tech. Rep. 87-47, LITP, Université Paris 6, France, 1987, to appear in Theoretical Computer Science.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  41. W. ZIELONKA, “Safe execution of recognizable trace languages by asynchronous automata”, Lecture Notes in Computer Science 363, p. 278–289, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP Université Paris 6, 4, Place Jussieu, 75252, Paris Cedex 05, France

    Paul Gastin

Authors
  1. Paul Gastin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Irène Guessarian

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Gastin, P. (1990). Infinite traces. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-53479-2_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53479-2

  • Online ISBN: 978-3-540-46897-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation