Advertisement

Acacia+, a Tool for LTL Synthesis

  • Aaron Bohy
  • Véronique Bruyère
  • Emmanuel Filiot
  • Naiyong Jin
  • Jean-François Raskin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7358)

Abstract

We present Acacia+, a tool for solving the LTL realizability and synthesis problems. We use recent approaches that reduce these problems to safety games, and can be solved efficiently by symbolic incremental algorithms based on antichains. The reduction to safety games offers very interesting properties in practice: the construction of compact solutions (when they exist) and a compositional approach for large conjunctions of LTL formulas.

Keywords

Church problem LTL synthesis antichains safety games Moore machines 

References

  1. 1.
  2. 2.
    Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Principles of Programming Languages, POPL, pp. 179–190. ACM (1989)Google Scholar
  3. 3.
    Abadi, M., Lamport, L., Wolper, P.: Realizable and Unrealizable Specifications of Reactive Systems. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 1–17. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  4. 4.
    Safra, S.: On the complexity of ω-automata. In: Foundations of Computer Science, FOCS, pp. 319–327. IEEE Computer Society (1988)Google Scholar
  5. 5.
    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
  6. 6.
    Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: Foundations of Computer Science, FOCS, pp. 531–542. IEEE Computer Society (2005)Google Scholar
  7. 7.
  8. 8.
    Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: Formal Methods in Computer-Aided Design, FMCAD, pp. 117–124. IEEE Computer Society (2006)Google Scholar
  9. 9.
    Schewe, S., Finkbeiner, B.: Bounded Synthesis. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 474–488. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
  11. 11.
    Ehlers, R.: Symbolic bounded synthesis. Formal Methods in System Design 40, 232–262 (2012)CrossRefGoogle Scholar
  12. 12.
    Ehlers, R.: Unbeast: Symbolic Bounded Synthesis. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 272–275. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  13. 13.
    Filiot, E., Jin, N., Raskin, J.F.: Antichains and compositional algorithms for LTL synthesis. Journal of Formal Methods in System Design 39, 261–296 (2011)CrossRefGoogle Scholar
  14. 14.
    Filiot, E., Jin, N., Raskin, F.: Exploiting structure in LTL synthesis. International Journal on Software Tools for Technology Transfer, 1–21 (2012)Google Scholar
  15. 15.
    Martin, D.: Borel determinacy. Annals of Mathematics 102, 363–371 (1975)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
  17. 17.
    De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A New Algorithm for Checking Universality of Finite Automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17–30. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  18. 18.
    Doyen, L., Raskin, J.-F.: Improved Algorithms for the Automata-Based Approach to Model-Checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 451–465. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  19. 19.
  20. 20.
  21. 21.
  22. 22.
    Könighofer, R., Hofferek, G., Bloem, R.: Debugging unrealizable specifications with model-based diagnosis. In: Raz, O. (ed.) HVC 2010. LNCS, vol. 6504, pp. 29–45. Springer, Heidelberg (2010)Google Scholar
  23. 23.
    Ehlers, R.: Minimising Deterministic Büchi Automata Precisely Using SAT Solving. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 326–332. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  24. 24.
    Schewe, S.: Beyond hyper-minimisation - Minimising DBAs and DPAs is NP-complete. In: Theory and Applications of Satisfiability Testing, FSTTCS. LIPIcs, vol. 8, pp. 400–411. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Aaron Bohy
    • 1
  • Véronique Bruyère
    • 1
  • Emmanuel Filiot
    • 2
  • Naiyong Jin
    • 3
  • Jean-François Raskin
    • 2
  1. 1.Université de Mons (UMONS)Belgium
  2. 2.Université Libre de Bruxelles (ULB)Belgium
  3. 3.Synopsys Inc.USA

Personalised recommendations