Reference: Alin Stefanescu, Javier Esparza, and Anca Muscholl. Synthesis of distributed algorithms using asynchronous automata. In R. Amadio and D. Lugiez, editors, Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), volume 2761, pages 27–41. Springer, September 2003. 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. Suggested BibTeX entry: @inproceedings{SEM03,     author = {Alin Stefanescu and Javier Esparza and Anca Muscholl},     booktitle = {Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03)},     editor = {R. Amadio and D. Lugiez},     month = {September},     pages = {27--41},     publisher = {Springer},     title = {Synthesis of Distributed Algorithms Using Asynchronous Automata},     volume = {2761},     year = {2003} }

PDF (242 kB) Full version, Slides, Implementation