Skip to main content
SpringerLink
Log in

On the synchronization of traces

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

Trace theory has been developed to describe the behavior of concurrent systems. Synchronization of traces is of special interest for a modular approach. We characterize those trace monoids for which synchronization can be described locally.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. J. Aalbersberg and G. Rozenberg. Theory of traces. Report 86-16, University of Leiden, Vakgroep Informatica, 1986.

  2. I. J. Aalbersberg and G. Rozenberg. Theory of traces.Theoret. Comput. Sci., 60:1–82, 1988.

    Google Scholar 

  3. P. Cartier and D. Foata.Problèmes combinatoires de commutation et réarrangements. Lecture Notes in Mathematics, vol. 85. Springer-Verlag, Berlin, 1969.

    Google Scholar 

  4. M. Clerbout and M. Latteux. Partial commutations and faithful rational transductions.Theoret. Comput. Sci., 35:241–254, 1985.

    Google Scholar 

  5. R. Cori and Y. Métivier. Recognizable subsets of some partially abelian monoids.Theoret. Comput. Sci., 35:241–254, 1985.

    Google Scholar 

  6. R. Cori and D. Perrin. Automates et commutations partielles.RAIRO Inform. Théor. Appl., 19:21–32, 1985.

    Google Scholar 

  7. V. Diekert and W. Vogler. Local checking of trace synchronizability. In M. Chytilet al., editors.Proceedings of the 13th Symposium on Mathematical Foundations of Computer Science (MFCS '88), Carlsbad, 1988. Lecture Notes in Computer Science, vol. 324, 271–279. Springer-Verlag, Berlin, 1988.

    Google Scholar 

  8. W. Fischer. Über erkennbare und rationale Mengen in freien partiell kommutativen Monoiden. Report FBI-HH-B-121/86, Fachbereich Informatik der Universität Hamburg, Hamburg, 1986.

    Google Scholar 

  9. S. MacLane,Categories. For the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer-Verlag, New York, 1970.

    Google Scholar 

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

    Google Scholar 

  11. A. Mazurkiewicz. Trace theory. In W. Braueret al., editors,Petri Nets, Applications and Relationship to Other Models of Concurrency. Lecture Notes in Computer Science, vol. 255, pp. 279–324. Springer-Verlag, Berlin, 1987.

    Google Scholar 

  12. D. Perrin. Words over a partially commutative alphabet. Report no. 84-59, LITP Université de Paris VII, 1984. Also appeared in A. Apostolico, editor,Combinatorial Algorithms on Words. NATO ASI Series, vol. F12, pp. 329–340. Springer-Verlag, New York, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstrasse 21, D-8000, München 2, Federal Republic of Germany

    Volker Diekert & Walter Vogler

Authors
  1. Volker Diekert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Diekert, V., Vogler, W. On the synchronization of traces. Math. Systems Theory 22, 161–175 (1989). https://doi.org/10.1007/BF02088296

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02088296

Keywords

Search

Navigation