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.
This work has been partly supported by the ESF project GASICS, the ARC project Game Theory for the Automatic Synthesis of Computer Systems and the ERC Strarting Grant inVEST.
Chapter PDF
Similar content being viewed by others
References
Acacia+, www.lit2.ulb.ac.be/acaciaplus/
Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Principles of Programming Languages, POPL, pp. 179–190. ACM (1989)
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)
Safra, S.: On the complexity of ω-automata. In: Foundations of Computer Science, FOCS, pp. 319–327. IEEE Computer Society (1988)
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)
Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: Foundations of Computer Science, FOCS, pp. 531–542. IEEE Computer Society (2005)
Lily, www.iaik.tugraz.at/content/research/design_verification/lily/
Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: Formal Methods in Computer-Aided Design, FMCAD, pp. 117–124. IEEE Computer Society (2006)
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)
Ehlers, R.: Symbolic bounded synthesis. Formal Methods in System Design 40, 232–262 (2012)
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)
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)
Filiot, E., Jin, N., Raskin, F.: Exploiting structure in LTL synthesis. International Journal on Software Tools for Technology Transfer, 1–21 (2012)
Martin, D.: Borel determinacy. Annals of Mathematics 102, 363–371 (1975)
Acacia, www.lit2.ulb.ac.be/acacia/
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)
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)
Wring, www.iaik.tugraz.at/content/research/design_verification/wring/
IBM RuleBase Tutorial, www.haifa.ibm.com/projects/verification/rb_homepage/tutorial3
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bohy, A., Bruyère, V., Filiot, E., Jin, N., Raskin, JF. (2012). Acacia+, a Tool for LTL Synthesis. In: Madhusudan, P., Seshia, S.A. (eds) Computer Aided Verification. CAV 2012. Lecture Notes in Computer Science, vol 7358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31424-7_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-31424-7_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31423-0
Online ISBN: 978-3-642-31424-7
eBook Packages: Computer ScienceComputer Science (R0)