Asynchronous Cellular Automata for Infinite Traces

The notion of infinite traces has been proposed to generalize both the finite traces defined by Mazurkicwicz and the infinite words. The family of recognizable languages of infinite traces has been introduced by means of recognizing morphisms and characterized by c-rational expressions. In this paper, we provide another characterization of this family using asynchronous cellular automata (which carry the most intuitive idea of finite suite concurrent machines). To this purpose, we give effective constructions for c-rational operations on these automata, which are of independent interest.

[1]  Volker Diekert.  On the concatenation of infinite traces (extended abstract) , 1991 .

[2]  Marta Z. Kwiatkowska,et al.  A Metric for Traces , 1990, Inf. Process. Lett..

[3]  Paul Gatin.  Recognizable and rational languages of finite an infinite traces , 1991 .

[4]  Edward Ochmanski,et al.  Regular behaviour of concurrent systems , 1985, Bull. EATCS.

[5]  Dominique Perrin,et al.  Partial Commutations , 1989, ICALP.

[6]  Volker Diekert.  On the Concentration of Infinite Traces , 1993, Theor. Comput. Sci..

[7]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[8]  Paul Gastin,et al.  Recognizable Complex Trace Languages , 1991, MFCS.

[9]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  Paul Gastin,et al.  A Kleene Theorem for Infinite Trace Languages , 1991, ICALP.

[11]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

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

[13]  Paul Gastin,et al.  Infinite Traces , 1990, Semantics of Systems of Concurrent Processes.

[14]  Paul Gastin,et al.  The Poset of Infinitary Traces , 1993, Theor. Comput. Sci..

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

[16]  Yves Métivier,et al.  Asynchronous Mappings and Asynchronous Cellular Automata , 1993, Inf. Comput..

[17]  Wolfgang Thomas.  On Logics, Tilings, and Automata , 1991, ICALP.

[18]  Wieslaw Zielonka.  Safe Executions of Recognizable Trace Languages by Asynchronous Automata , 1989, Logic at Botik.

[19]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

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

[21]  Thomas Sudkamp,et al.  Languages and Machines , 1988 .

[22]  Volker Diekert,et al.  Combinatorics on Traces , 1990, Lecture Notes in Computer Science.

[23]  Antoni W. Mazurkiewicz,et al.  Trace Theory , 1986, Advances in Petri Nets.