Advertisement

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

  • R. Cori
  • Y. Métivier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 317)

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.

Keywords

Asynchronous Automaton Recognizable Subset 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    R. Cori et D. Perrin, Automates et commutations partielles, RAIRO Inform. Théor. Vol 19, 1985, pp. 21–32.Google Scholar
  3. [3]
    M.P. Flé and G. Roucairol, Maximal serializability of iterated transactions, Theoret. Comput. Sci. 38, 1985, pp. 1–16.Google Scholar
  4. [4]
    L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM 21, 1978.Google Scholar
  5. [5]
    A. Mazurkiewicz, Traces, Histories, Graphs: instances of a process monoid, Lecture Notes in Comput. Sci. 176, 1984, pp. 115–133.Google Scholar
  6. [6]
    Y. Metivier, On recognizable subsets of free partially commutative monoids, Lecture Notes in Comput. Sci. 226, 1986, pp. 254–264.Google Scholar
  7. [7]
    C. Papadimitriou, The serializability of concurrent databases updates, J. Assoc. Comput. Mach. 26, 1979, pp. 631–653.Google Scholar
  8. [8]
    W. Zielonka, Notes on asynchronous automata, RAIRO Inform. Théor. Vol 21, 1987, pp. 99–135.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • R. Cori
    • 1
  • Y. Métivier
    • 1
  1. 1.Université de Bordeaux I, U.E.R. de Mathématiques et InformatiqueTalenceFrance

Personalised recommendations