Synthesis of Distributed Algorithms Using Asynchronous Automata

  • Alin Ştefănescu
  • Javier Esparza
  • Anca Muscholl
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2761)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Amo]
  2. [BD98]
    Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 529–588. Springer, Heidelberg (1998)Google Scholar
  3. [CMT99]
    Castellani, I., Mukund, M., Thiagarajan, P.S.: Synthesizing distributed transition systems from global specifications. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 219–231. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  4. [DR95]
    Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)Google Scholar
  5. [EC82]
    Emerson, E.A., Clarke, E.M.: Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming 2, 241–266 (1982)zbMATHCrossRefGoogle Scholar
  6. [KV01]
    Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proc. 16th IEEE Symp. on Logic in Computer Science (2001)Google Scholar
  7. [Maz87]
    Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 279–324. Springer, Heidelberg (1987)Google Scholar
  8. [Mor98]
    Morin, R.: Decompositions of asynchronous systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 549–564. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. [MT02]
    Madhusudan, P., Thiagarajan, P.S.: A decidable class of asynchronous distributed controllers. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 145–160. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  10. [Muk02]
    Mukund, M.: From global specifications to distributed implementations. In: Caillaud, B., Darondeau, P., Lavagno, L. (eds.) Synthesis and Control of Discrete Event Systems, pp. 19–34. Kluwer, Dordrecht (2002)Google Scholar
  11. [MW84]
    Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic. ACM TOPLAS 6(1), 68–93 (1984)zbMATHCrossRefGoogle Scholar
  12. [PR89]
    Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652–671. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  13. [SEM03]
    Ştefănescu, A., Esparza, J., Muscholl, A.: Synthesis of distributed algorithms using asynchronous automata. Available at:
  14. [Zie87]
    Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. Inform. Théor. Appl. 21, 99–135 (1987)zbMATHMathSciNetGoogle Scholar
  15. [Zie89]
    Zielonka, W.: Safe executions of recognizable trace languages by asynchronous automata. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 278–289. Springer, Heidelberg (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alin Ştefănescu
    • 1
  • Javier Esparza
    • 1
  • Anca Muscholl
    • 2
  1. 1.Institut für Formale Methoden der InformatikStuttgartGermany
  2. 2.LIAFAUniversité Paris VIIParis

Personalised recommendations