Skip to main content
SpringerLink
Log in

Complex and complex-like traces

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1993 (MFCS 1993)

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

Abstract

The definition and some known results on complex traces are reviewed. We also discuss some open questions concerning the Posetproperty of complex traces. The main new contribution of the paper is the presentation of the notion of complex-like trace. Every complex trace is complex-like, but there are other objects such as a finite trace with some additional non-empty alphabetic information. In the sequential case this information is nothing else than explicit termination. Together with concurrency the concept leads to a rich mathematical structure. Our results show that complex-like traces form a prime algebraic and coherently complete Scott-domain. Our main theorem shows that the concatenation on this domain is continuous.

This research has been partially supported by the ESPRIT Basic Research Actions No. 6137 ASMICS II

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.

References

  1. I.J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1–82, 1988.

    Google Scholar 

  2. P. Bonizzoni, G. Mauri, and G. Pighizzini. About infinite traces. In V. Diekert, editor, Proceedings of the ASMICS workshop Free Partially Commutative Monoids, Kochel am See, Oktober 1989, Report TUM-I9002, Technical University of Munich, pages 1–10, 1990.

    Google Scholar 

  3. V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990.

    Google Scholar 

  4. V. Diekert. On the concatenation of infinite traces. In Choffrut C. et al., editors, Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), Hamburg 1991, number 480 in Lecture Notes in Computer Science, pages 105–117, Berlin-Heidelberg-New York, 1991. Springer. To appear 1993 in Theoret. Comput. Sci.

    Google Scholar 

  5. V. Diekert, P. Gastin, and A. Petit. Recognizable complex trace languages. In A. Tarlecki, editor, Proceedings of the 16th Symposium on Mathematical Foundations of Computer Science (MFCS'91), Kazimierz Dolny (Poland) 1991, number 520 in Lecture Notes in Computer Science, pages 131–140, Berlin-Heidelberg-New York, 1991. Springer. Full version: Rapport de Recherche 640 (1991), Université de Paris Sud.

    Google Scholar 

  6. V. Diekert and A. Muscholl. Deterministic asynchronous automata for infinite traces. In P. Enjalbert, A. Finkel, and K. W. Wagner, editors, Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS'93), Würzburg 1993, number 665 in Lecture Notes in Computer Science, pages 617–628, Berlin-Heidelberg-New York, 1993. Springer.

    Google Scholar 

  7. V. Diekert and G. Rozenberg, editors. Trace Book (preliminary title). 1993. To appear.

    Google Scholar 

  8. V. Diekert, editor, editor. Free Partially Commutative Monoids. Proceedings of a workshop of the ESPRIT Basic Research Action No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), Kochel am See, Bavaria, FRG (1989), number TUM-I9002. Technical University Munich, 1990.

    Google Scholar 

  9. Werner Ebinger and Anca Muscholl. On logical definability of ω-trace languages. In Proceedings of the 20th International Colloquium on Automata Languages and Programming (ICALP'93), Lund (Sweden) 1993, Lecture Notes in Computer Science, Berlin-Heidelberg-New York, 1993. Springer. To appear.

    Google Scholar 

  10. M.P. Flé and G. Roucairol. Maximal serializability of iterated transactions. Theoretical Computer Science, 38:1–16, 1985.

    Google Scholar 

  11. P. Gastin. Infinite traces. In I. Guessarian, editor, Proceedings of the Spring School of Theoretical Computer Science on Semantics of Systems of Concurrent Processes, number 469 in Lecture Notes in Computer Science, pages 277–308, Berlin-Heidelberg-New York, 1990. Springer.

    Google Scholar 

  12. P. Gastin, A. Petit, and W. Zielonka. A Kleene theorem for infinite trace languages. In J. Leach Albert et al., editors, Proceedings of the 18th International Colloquium on Automata Languages and Programming (ICALP'91), Madrid (Spain) 1991, number 510 in Lecture Notes in Computer Science, pages 254–266, Berlin-Heidelberg-New York, 1991. Springer.

    Google Scholar 

  13. P. Gastin and B. Rozoy. The poset of infinitary traces. Tech. Rep. LITP 91.07, Université Paris 6 (France), 1991. To appear in Theoret. Comp. Sci.

    Google Scholar 

  14. Paul Gastin and Antoine Petit. Asynchronous automata for infinite traces. In W. Kuich, editor, Proceedings of the 19th International Colloquium on Automata Languages and Programming (ICALP'92), Vienna (Austria) 1992, number 623 in Lecture Notes in Computer Science, pages 583–594, Berlin-Heidelberg-New York, 1992. Springer.

    Google Scholar 

  15. Paul Gastin and Antoine Petit. Poset properties of complex traces. In I. M. Havel and V. Koubek, editors, Proceedings of the 17th Symposium on Mathematical Foundations of Computer Science (MFCS'92), Prague, (Czechoslovakia), 1992, number 629 in Lecture Notes in Computer Science, pages 255–263, Berlin-Heidelberg-New York, 1992. Springer.

    Google Scholar 

  16. M. Kwiatkowska. A metric for traces. Information Processing Letters, 35:129–135, 1990.

    Google Scholar 

  17. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.

    Google Scholar 

  18. A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications and Relationship to other Models of Concurrency, number 255 in Lecture Notes in Computer Science, pages 279–324, Berlin-Heidelberg-New York, 1987. Springer.

    Google Scholar 

  19. Y. Métivier. On recognizable subsets of free partially commutative monoids. In L. Kott, editor, Proceedings of the 13th International Colloquium on Automata Languages and Programming (ICALP'86), Rennes (France) 1986, number 226 in Lecture Notes in Computer Science, pages 254–264, Berlin-Heidelberg-New York, 1986. Springer.

    Google Scholar 

  20. E. Ochmanski. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:56–67, Oct 1985.

    Google Scholar 

  21. D. Perrin. Partial commutations. In Proceedings of the 16th International Colloquium on Automata, Languages and Programming (ICALP'89), Stresa (Italy) 1989, number 372 in Lecture Notes in Computer Science, pages 637–651, Berlin-Heidelberg-New York, 1989. Springer.

    Google Scholar 

  22. D. Perrin and J.E. Pin. Mots Infinis. Tech. Rep. LITP 91.06, Université Paris 6 (France), 1991. Book to appear.

    Google Scholar 

  23. Dan Teodosiu. Bereichseigenschaften komplexer Spuren. Diplomarbeit, Universität Stuttgart, 1993.

    Google Scholar 

  24. Wolfgang Thomas. Automata on infinite objects. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133–191. Elsevier Science Publishers B. V., 1990.

    Google Scholar 

  25. Wolfgang Thomas. On logical definability of trace languages. In V. Diekert, editor, Proceedings of a workshop of the ESPRIT Basic Research Action No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), Kochel am See, Bavaria, FRG (1989), Report TUM-I9002, Technical University of Munich, pages 172–182, 1990.

    Google Scholar 

  26. X.G. Viennot. Heaps of pieces I: Basic definitions and combinatorial lemmas. In G. Labelle et al., editors, Proceedings Combinatoire énumerative, Montreal, Quebec (Canada) 1985, number 1234 in Lecture Notes in Mathematics, pages 321–350, Berlin-Heidelberg-New York, 1986. Springer.

    Google Scholar 

  27. W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O. — Informatique Théorique et Applications, 21:99–135, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstr. 20-22, D 70565, Stuttgart

    Volker Diekert

Authors
  1. Volker Diekert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Diekert, V. (1993). Complex and complex-like traces. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation