Article

A multi-encoding approach for LTL symbolic satisfiability checking

Authors:

Kristin Y. Rozier,

Moshe Y. VardiAuthors Info & Claims

FM'11: Proceedings of the 17th international conference on Formal methods

Pages 417 - 431

Published: 20 June 2011 Publication History

Abstract

Formal behavioral specifications written early in the system-design process and communicated across all design phases have been shown to increase the efficiency, consistency, and quality of the system under development. To prevent introducing design or verification errors, it is crucial to test specifications for satisfiability. Our focus here is on specifications expressed in linear temporal logic (LTL).

We introduce a novel encoding of symbolic transition-based Büchi automata and a novel, "sloppy," transition encoding, both of which result in improved scalability. We also define novel BDD variable orders based on tree decomposition of formula parse trees. We describe and extensively test a new multi-encoding approach utilizing these novel encoding techniques to create 30 encoding variations. We show that our novel encodings translate to significant, sometimes exponential, improvement over the current standard encoding for symbolic LTL satisfiability checking.

References

[1]

Amla, N., Du, X., Kuehlmann, A., Kurshan, R.P., McMillan, K.L.: An analysis of SAT-based model checking techniques in an industrial environment. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 254-268. Springer, Heidelberg (2005).

Digital Library

[2]

Beer, I., Ben-David, S., Eisner, C., Rodeh, Y.: Efficient detection of vacuity in ACTL formulas. FMSD 18(2), 141-162 (2001).

Digital Library

[3]

Biere, A., Artho, C., Schuppan, V.: Liveness checking as safety checking. In: FMICS, vol. 66(2) (2002).

[4]

Bloem, R., Cimatti, A., Pill, I., Roveri, M.: Symbolic implementation of alternating automata. IJFCS 18(4), 727-743 (2007).

[5]

Bryant, R.E.:Graph-based algorithms for Boolean-function manipulation. IEEE TC C-35(8), 677-691 (1986).

Digital Library

[6]

Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 10²⁰ states and beyond. Inform. and Computation 98(2), 142-170 (1992).

Digital Library

[7]

Cichon, J., Czubak, A., Jasinski, A.: Minimal Büchi automata for certain classes of LTL formulas. In: DepCoS, pp. 17-24 (2009).

Digital Library

[8]

Cimatti, A., Roveri, M., Semprini, S., Tonetta, S.: From PSL to NBA: A modular symbolic encoding. In: FMCAD (2006).

Digital Library

[9]

Cimatti, A., Roveri, M., Tonetta, S.: Syntactic optimizations for PSL verification. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 505-518. Springer, Heidelberg (2007).

Digital Library

[10]

Clarke, E.M., Grumberg, O., Hamaguchi, K.: Another look at LTL model checking. Formal Methods in System Design 10(1), 47-71 (1997).

Digital Library

[11]

Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory efficient algorithms for the verification of temporal properties. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 233-242. Springer, Heidelberg (1991).

Digital Library

[12]

Couvreur, J.-M.: On-the-fly verification of Linear Temporal Logic. In: Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 253-271. Springer, Heidelberg (1999).

Digital Library

[13]

Daniele, M., Giunchiglia, F., Vardi, M.Y.: Improved Automata Generation for Linear Temporal Logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 249-260. Springer, Heidelberg (1999).

Digital Library

[14]

De Wulf, M., Doyen, L., Maquet, N., Raskin, J.-F.: Antichains: Alternative algorithms for LTL satisfiability and model-checking. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 63-77. Springer, Heidelberg (2008).

Digital Library

[15]

Duret-Lutz, A., Poitrenaud, D.: SPOT: An extensible model checking library using Transition-Based Generalized Büchi Automata. In: MASCOTS, pp. 76-83 (2004).

Digital Library

[16]

Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science, vol. B, ch. 16, pp. 997-1072. Elsevier, MIT Press (1990).

Digital Library

[17]

Ferrara, A., Pan, G., Vardi, M.Y.: Treewidth in verification: Local vs. Global. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 489-503. Springer, Heidelberg (2005).

Digital Library

[18]

Fisher, M.: A normal form for temporal logics and its applications in theorem-proving and execution. J. Log. Comput. 7(4), 429-456 (1997).

[19]

Fisman, D., Kupferman, O., Sheinvald-Faragy, S., Vardi, M.Y.: A framework for inherent vacuity. In: Chockler, H., Hu, A.J. (eds.) HVC 2008. LNCS, vol. 5394, pp. 7-22. Springer, Heidelberg (2009).

Digital Library

[20]

Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53-65. Springer, Heidelberg (2001).

Digital Library

[21]

Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of Linear Temporal Logic. In: PSTV, pp. 3-18. Chapman and Hall, Boca Raton (1995).

Digital Library

[22]

Giannakopoulou, D., Lerda, F.: From states to transitions: Improving translation of LTL formulae to Büchi automata. In: FORTE (November 2002).

Digital Library

[23]

Goranko, V., Kyrilov, A., Shkatov, D.: Tableau tool for testing satisfiability in LTL: Implementation and experimental analysis. ENTCS 262, 113-125 (2010).

Digital Library

[24]

Habibi, A., Tahar, S.: Design for verification of SystemC transaction level models. In: Design, Automation and Test in Europe, pp. 560-565. IEEE, Los Alamitos (2005).

Digital Library

[25]

Kesten, Y., Manna, Z., McGuire, H., Pnueli, A.: A decision algorithm for full propositional temporal logic. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 97-109. Springer, Heidelberg (1993).

Digital Library

[26]

Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. ZIB-Report 01-38, ZIB (2001).

[27]

Kupferman, O., Vardi, M.Y.: Vacuity detection in temporal model checking. STTT 4(2), 224-233 (2003).

[28]

Merz, S., Sezgin, A.: Emptiness of Linear Weak Alternating Automata. Technical report, LORIA (December 2003).

[29]

Pan, G., Sattler, U., Vardi, M.Y.: BDD-based decision procedures for K. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 16-30. Springer, Heidelberg (2002).

Digital Library

[30]

Pill, I., Semprini, S., Cavada, R., Roveri, M., Bloem, R., Cimatti, A.: Formal analysis of hardware requirements. In: DAC, pp. 821-826. ACM, New York (2006).

Digital Library

[31]

Pnueli, A.: The temporal logic of programs. In: IEEE FOCS, pp. 46-57 (1977).

Digital Library

[32]

Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179-190 (1989).

Digital Library

[33]

Pulina, L., Tacchella, A.: A self-adaptive multi-engine solver for quantified Boolean formulas. Constraints 14(1), 80-116 (2009).

Digital Library

[34]

Roveri, M.: Novel techniques for property assurance. Technical report, PROSYD deliverable 1.2/2 (2004).

[35]

Rozier, K.Y., Vardi, M.Y.: LTL satisfiability checking. In: Bošnački, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 149-167. Springer, Heidelberg (2007).

Digital Library

[36]

Ruah, S., Fedeli, A., Eisner, C., Moulin, M.: Property-driven specification of VLSI design. Technical report, PROSYD deliverable 1.1/1 (2005).

[37]

Schneider, K.: Improving automata generation for Linear Temporal Logic by considering the automaton hierarchy. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 39-54. Springer, Heidelberg (2001).

Digital Library

[38]

Sebastiani, R., Tonetta, S.: "More deterministic" vs. "smaller" Büchi automata for efficient LTL model checking. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol. 2860, pp. 126-140. Springer, Heidelberg (2003).

[39]

Sistla, A.P., Clarke, E.M.: The complexity of Propositional Linear Temporal Logic. J. ACM 32, 733-749 (1985).

Digital Library

[40]

Somenzi, F., Bloem, R.: Effficient Büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 248-263. Springer, Heidelberg (2000).

Digital Library

[41]

Thirioux, X.: Simple and efficient translation from LTL formulas to Büchi automata. ENTCS 66(2), 145-159 (2002).

[42]

Vardi, M.Y.: Automata-theoretic model checking revisited. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 137-150. Springer, Heidelberg (2007).

Digital Library

[43]

Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: LICS, Cambridge, pp. 332-344 (June 1986).

[44]

Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Information and Computation 115(1), 1-37 (1994).

Digital Library

Cited By

Fionda VGreco G(2019)LTL on finite and process tracesJournal of Artificial Intelligence Research10.1613/jair.1.1125663:1(557-623)Online publication date: 17-Apr-2019
https://dl.acm.org/doi/10.1613/jair.1.11256
Kong JLomuscio ALarson KWinikoff MDas SDurfee E(2017)Symbolic Model Checking Multi-Agent Systems against CTL*K SpecificationsProceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems10.5555/3091125.3091147(114-122)Online publication date: 8-May-2017
https://dl.acm.org/doi/10.5555/3091125.3091147
Bendík JBultan TSen K(2017)Consistency checking in requirements analysisProceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3092703.3098239(408-411)Online publication date: 10-Jul-2017
https://dl.acm.org/doi/10.1145/3092703.3098239
Show More Cited By

A multi-encoding approach for LTL symbolic satisfiability checking
1. Software and its engineering
  1. Software organization and properties
    1. Software functional properties
      1. Formal methods

Recommendations

LTL satisfiability checking

We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-checking benchmarks to both explicit and symbolic model checkers. For symbolic ...
Satisfiability checking for Mission-time LTL (MLTL)
Abstract
Mission-time Linear Temporal Logic (LTL), abbreviated as MLTL, is a bounded variant of Metric Temporal Logic (MTL) over naturals designed to generically specify requirements for mission-based system operation common to aircraft, ...
LTL_f satisfiability checking
ECAI'14: Proceedings of the Twenty-first European Conference on Artificial Intelligence

We consider here Linear Temporal Logic (LTL) formulas interpreted over finite traces. We denote this logic by LTL_f. The existing approach for LTL_f satisfiability checking is based on a reduction to standard LTL satisfiability checking. We describe here ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

FM'11: Proceedings of the 17th international conference on Formal methods

June 2011

449 pages

ISBN:9783642214363

Editors:
Michael Butler
University of Southampton, Electronics and Computer Science, Southampton, UK
,
Wolfram Schulte
Microsoft Research, Redmond, WA

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 20 June 2011

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Fionda VGreco G(2019)LTL on finite and process tracesJournal of Artificial Intelligence Research10.1613/jair.1.1125663:1(557-623)Online publication date: 17-Apr-2019
https://dl.acm.org/doi/10.1613/jair.1.11256
Kong JLomuscio ALarson KWinikoff MDas SDurfee E(2017)Symbolic Model Checking Multi-Agent Systems against CTL*K SpecificationsProceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems10.5555/3091125.3091147(114-122)Online publication date: 8-May-2017
https://dl.acm.org/doi/10.5555/3091125.3091147
Bendík JBultan TSen K(2017)Consistency checking in requirements analysisProceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3092703.3098239(408-411)Online publication date: 10-Jul-2017
https://dl.acm.org/doi/10.1145/3092703.3098239
D'Antoni LVeanes M(2017)Forward Bisimulations for Nondeterministic Symbolic Finite AutomataProceedings, Part I, of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 1020510.1007/978-3-662-54577-5_30(518-534)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54577-5_30
Baresi LPourhashem Kallehbasti MRossi MBertolino ACanfora GElbaum S(2015)Efficient scalable verification of LTL specificationsProceedings of the 37th International Conference on Software Engineering - Volume 110.5555/2818754.2818841(711-721)Online publication date: 16-May-2015
https://dl.acm.org/doi/10.5555/2818754.2818841
Crampton JHuth MKuo J(2014)Authorized workflow schemasInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-012-0269-316:1(31-48)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1007/s10009-012-0269-3
Schuppan VDarmawan L(2011)Evaluating LTL satisfiability solversProceedings of the 9th international conference on Automated technology for verification and analysis10.5555/2050917.2050947(397-413)Online publication date: 11-Oct-2011
https://dl.acm.org/doi/10.5555/2050917.2050947

View Options

View options

Figures

Tables

Media

View Table of Conten