论文信息 - Modular Constructions of Distributing Automata - 字舞流文

Modular Constructions of Distributing Automata

Antoine Petit | Sébastien Huguet

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

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

[3] Giovanni Pighizzini. Synthesis of nondeterministic asynchronous automata , 1993 .

[4] Volker Diekert,et al. The Book of Traces , 1995 .

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

[6] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

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

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

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

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

[11] Madhavan Mukund,et al. Determinizing Asynchronous Automata , 1994, ICALP.

[12] Anca Muscholl. On the Complementation of Büchi Asynchronous Cellular Automata , 1994, ICALP.

[13] Yves Métivier. Une Condition Suffisante de Reconnaissabilité Dans un Monoïde Partiellement Commutatif , 1986, RAIRO Theor. Informatics Appl..