Skip to main content
Springer Nature Link
Log in

Approximation of a trace, asynchronous automata and the ordering of events in a distributed system

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1988)

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

Included in the following conference series:

  • 209 Accesses

Abstract

The notion of trace was introduced in order to modelize the concurrency of actions. A trace is an element of the quotient of the free monoid by the congruence generated by a finite set of relations of the form ab∼ba. We introduce the notion of the approximation of a trace and we study its properties. The main result is the existence of an asynchronous automaton which recognizes the set of traces corresponding to an approximation. We give two applications : the first one is a new proof of Zielonka's theorem, and the second one is an algorithm for the ordering of events in a distributed system.

The work reported in this article was carried out with the support of the PRC "Mathémathiques et Informatique" of the CNRS and with the support of the "GRECO de PROGRAMMATION".

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.

Similar content being viewed by others

References

  1. IJ.J.Aalbersberg and G.Rozenberg, Theory of traces, Institute of Applied Mathematics and Computer Science, University of Leiden, Rep. n0 86–16, 1986.

    Google Scholar 

  2. R. Cori et D. Perrin, Automates et commutations partielles, RAIRO Inform. Théor. Vol 19, 1985, pp. 21–32.

    Google Scholar 

  3. M.P. Flé and G. Roucairol, Maximal serializability of iterated transactions, Theoret. Comput. Sci. 38, 1985, pp. 1–16.

    Google Scholar 

  4. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM 21, 1978.

    Google Scholar 

  5. A. Mazurkiewicz, Traces, Histories, Graphs: instances of a process monoid, Lecture Notes in Comput. Sci. 176, 1984, pp. 115–133.

    Google Scholar 

  6. Y. Metivier, On recognizable subsets of free partially commutative monoids, Lecture Notes in Comput. Sci. 226, 1986, pp. 254–264.

    Google Scholar 

  7. C. Papadimitriou, The serializability of concurrent databases updates, J. Assoc. Comput. Mach. 26, 1979, pp. 631–653.

    Google Scholar 

  8. W. Zielonka, Notes on asynchronous automata, RAIRO Inform. Théor. Vol 21, 1987, pp. 99–135.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Bordeaux I, U.E.R. de Mathématiques et Informatique, 33405, Talence, France

    R. Cori & Y. Métivier

Authors
  1. R. Cori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Métivier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Timo Lepistö Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cori, R., Métivier, Y. (1988). Approximation of a trace, asynchronous automata and the ordering of events in a distributed system. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_113

Download citation

  • DOI: https://doi.org/10.1007/3-540-19488-6_113

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19488-0

  • Online ISBN: 978-3-540-39291-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics