Effective Synthesis of Asynchronous Systems from GR(1) Specifications

  • Uri Klein
  • Nir Piterman
  • Amir Pnueli
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7148)


We consider automatic synthesis from linear temporal logic specifications for asynchronous systems. We aim the produced reactive systems to be used as software in a multi-threaded environment. We extend previous reduction of asynchronous synthesis to synchronous synthesis to the setting of multiple input and multiple output variables. Much like synthesis for synchronous designs, this solution is not practical as it requires determinization of automata on infinite words and solution of complicated games. We follow advances in synthesis of synchronous designs, which restrict the handled specifications but achieve scalability and efficiency. We propose a heuristic that, in some cases, maintains scalability for asynchronous synthesis. Our heuristic can prove that specifications are realizable and extract designs. This is done by a reduction to synchronous synthesis that is inspired by the theoretical reduction.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Automatic hardware synthesis from specifications: A case study. In: DATE, pp. 1188–1193 (2007)Google Scholar
  2. 2.
    Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. AMS 138, 295–311 (1969)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Church, A.: Logic, arithmetic and automata. In: Proc. 1962 Int. Congr. Math., Upsala, pp. 23–25 (1963)Google Scholar
  4. 4.
    Clarke, E.C., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)Google Scholar
  5. 5.
    Conner, D.C., Kress-Gazit, H., Choset, H., Rizzi, A., Pappas, G.J.: Valet parking without a valet. In: IRSES, pp. 572–577. IEEE (2007)Google Scholar
  6. 6.
    D’Ippolito, N., Braberman, V., Piterman, N., Uchitel, S.: Synthesis of live behavior models for fallible domains. In: ICSE. ACM (2011)Google Scholar
  7. 7.
    Henzinger, T.A., Piterman, N.: Solving Games Without Determinization. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 395–410. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Kugler, H., Plock, C., Pnueli, A.: Controller Synthesis from LSC Requirements. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol. 5503, pp. 79–93. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  9. 9.
    Klein, U., Piterman, N., Pnueli, A.: Effective Synthesis of Asynchronous Systems from GR(1) Specifications. Tech Rep TR2011-944, Courant Inst of Math Sci, NYUGoogle Scholar
  10. 10.
    Kugler, H., Segall, I.: Compositional Synthesis of Reactive Systems from Live Sequence Chart Specifications. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 77–91. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: FOCS (2005)Google Scholar
  12. 12.
    Piterman, N., Pnueli, A.: Faster solution of Rabin and Streett games. In: LICS, IEEE. IEEE Press (2006)Google Scholar
  13. 13.
    Piterman, N., Pnueli, A., Sa’ar, Y.: Synthesis of Reactive(1) Designs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 364–380. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  14. 14.
    Pnueli, A., Klein, U.: Synthesis of programs from temporal property specifications. In: MEMOCODE, pp. 1–7. IEEE Press (2009)Google Scholar
  15. 15.
    Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179–190 (1989)Google Scholar
  16. 16.
    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
  17. 17.
    Pnueli, A., Sa’ar, Y., Zuck, L.D.: Jtlv: A Framework for Developing Verification Algorithms. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 171–174. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  18. 18.
    Pnueli, A., Zaks, A.: On the Merits of Temporal Testers. In: Grumberg, O., Veith, H. (eds.) 25MC Festschrift. LNCS, vol. 5000, pp. 172–195. Springer, Heidelberg (2008)Google Scholar
  19. 19.
    Rabin, M.O.: Automata on Infinite Objects and Church’s Problem. AMS (1972)Google Scholar
  20. 20.
    Schewe, S., Finkbeiner, B.: Synthesis of Asynchronous Systems. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 127–142. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  21. 21.
    Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi autamata with application to temporal logic. TCS 49, 217–237 (1987)CrossRefzbMATHGoogle Scholar
  22. 22.
    Vardi, M.Y.: An Automata-Theoretic Approach to Fair Realizability and Synthesis. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 267–278. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  23. 23.
    Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. I&C 115(1), 1–37 (1994)MathSciNetzbMATHGoogle Scholar
  24. 24.
    Wongpiromsarn, T., Topcu, U., Murray, R.M.: Receding horizon control for temporal logic specifications. In: Johansson, K.H., Yi, W. (eds.) Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2010, Stockholm, Sweden, April 12-15, 2010, pp. 101–110. ACM (2010) ISBN 978-1-60558-955-8Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Uri Klein
    • 1
  • Nir Piterman
    • 2
  • Amir Pnueli
    • 1
  1. 1.Courant Institute of Mathematical SciencesNew York UniversityUSA
  2. 2.Department of Computer ScienceUniversity of LeicesterUK

Personalised recommendations