Synthesis of Distributed Algorithms Using Asynchronous Automata

We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and characterise the languages they accept. We analyze the complexity of the synthesis problem in our framework. Theorems by Zielonka and Morin are then used to develop and implement a synthesis algorithm. Finally, we apply the developed algorithms to the classic problem of mutual exclusion.

[1]  Pierre Wolper,et al.  An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages , 1998, Theor. Comput. Sci..

[2]  Anca Muscholl,et al.  A Note on the Commutative Closure of Star-Free Languages , 1996, Inf. Process. Lett..

[3]  Jacques Sakarovitch.  The "Last" Decision Problem for Rational Trace Languages , 1992, LATIN.

[4]  P. S. Thiagarajan,et al.  A Decidable Class of Asynchronous Distributed Controllers , 2002, CONCUR.

[5]  Philippe Darondeau,et al.  Theory of Regions , 1996, Petri Nets.

[6]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, Logic of Programs.

[7]  O. Kupermann,et al.  Synthesizing distributed systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

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

[9]  Madhavan Mukund,et al.  From Global Specifications to Distributed Implementations , 2002 .

[10]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1985 , 1985, Lecture Notes in Computer Science.

[11]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[12]  Luciano Lavagno,et al.  Synthesis and Control of Discrete Event Systems , 2002, Springer US.

[13]  Madhavan Mukund,et al.  Synthesizing Distributed Transition Systems from Global Specification , 1999, FSTTCS.

[14]  Rémi Morin,et al.  Decompositions of Asynchronous Systems , 1998, CONCUR.

[15]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[17]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[18]  Amir Pnueli,et al.  On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.

[19]  Wojciech Zielonka,et al.  The Book of Traces , 1995 .

[20]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

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

[22]  Anca Muscholl,et al.  Über die Erkennbarkeit unendlicher Spuren , 1994 .

[23]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[24]  Albert R. Meyer,et al.  Logic at Botik '89 , 1989, Lecture Notes in Computer Science.