Synthesis of Distributed Algorithms Using Asynchronous Automata

Abstract. 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.

• Type: Conference
• Year: 2003
• Where: CONCUR
• Authors: Alin Stefanescu, Javier Esparza, Anca Muscholl
• Keywords: Asynchronous Automata, CONCUR 2003, Safe Asynchronous Automata, Synthesis Problem