Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract)

We introduce new finite states "parallel machines", the distributed automata, for trace languages. We prove that these machines give a new characterization of recognizable trace languages: a trace language is recognizable if and only if it is recognized by a distributed automaton. Throughout this work we compare the distributed automata with the Zielonka's asynchronous automata.

[1]  Antoni W. Mazurkiewicz,et al.  Traces, Histories, Graphs: Instances of a Process Monoid , 1984, International Symposium on Mathematical Foundations of Computer Science.

[2]  Christine Duboc,et al.  Some Properties of Commutation in Free Partially Commutative Monoids , 1985, Inf. Process. Lett..

[3]  Dominique Perrin.  Words over a Partially Commutative Alphabet , 1985 .

[4]  Grzegorz Rozenberg,et al.  Theory of Traces , 1988, Theor. Comput. Sci..

[5]  Michel Latteux,et al.  Partial Commutations and Faithful Rational Transductions , 1984, Theor. Comput. Sci..

[6]  Yves Métivier,et al.  Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System , 1988, ICALP.

[7]  Gérard Roucairol,et al.  Maximal Serializability of Iterated Transactions , 1985, Theor. Comput. Sci..

[8]  Yves Métivier.  On Recognizable Subsets of Free Partially Commutative Monoids , 1988, Theor. Comput. Sci..

[9]  Antoni W. Mazurkiewicz.  Semantics of concurrent systems: a modular fixed-point trace approach , 1984, European Workshop on Applications and Theory in Petri Nets.

[10]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[11]  Michel Latteux,et al.  2-Asynchronous Automata , 1988, Theor. Comput. Sci..

[12]  Yves Métivier,et al.  Recognizable Subsets of Some Partially Abelian Monoids , 1985, Theor. Comput. Sci..

[13]  Jacques Sakarovitch,et al.  On Regular Trace Languages , 1987, Theor. Comput. Sci..

[14]  Giancarlo Mauri,et al.  Unambiguous regular trace languages , 1985 .

[15]  Giancarlo Mauri,et al.  Context-free trace languages , 1982 .

[16]  Christine Duboc.  Equations in Free Partially Commutative Monoids , 1986, STACS.

[17]  Pierre Cartier,et al.  Problemes combinatoires de commutation et rearrangements , 1969 .

[18]  Yves Métivier,et al.  An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs , 1987, ICALP.

[19]  Robert Cori,et al.  Automates et Commutations Partielles , 1985, RAIRO Theor. Informatics Appl..

[20]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[21]  Nicoletta Sabadini,et al.  On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace Languages , 1988, STACS.

[22]  Giancarlo Mauri,et al.  Equivalence and Membership Problems for Regular Trace Languages , 1982, ICALP.