On Refinement of Büchi Automata for Explicit Model Checking

  • František Blahoudek
  • Alexandre Duret-Lutz
  • Vojtěch Rujbr
  • Jan Strejček
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9232)


In explicit model checking, systems are typically described in an implicit and compact way. Some valid information about the system can be easily derived directly from this description, for example that some atomic propositions cannot be valid at the same time. The paper shows several ways to apply this information to improve the Büchi automaton built from an LTL specification. As a result, we get smaller automata with shorter edge labels that are easier to understand and, more importantly, for which the explicit model checking process performs better.


Model Check Atomic Proposition Edge Label Kripke Structure Verification Task 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



The authors would like to thank Tomáš Babiak and Jiří Barnat for discussions and tool support. František Blahoudek and Jan Strejček have been supported by The Czech Science Foundation grant GBP202/12/G061.


  1. 1.
    Accellera. Property specification language reference manual v1.1 (2004).
  2. 2.
    Babiak, T., Křetínský, M., Řehák, V., Strejček, J.: LTL to büchi automata translation: fast and more deterministic. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 95–109. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  3. 3.
    Babiak, T., Badie, T., Duret-Lutz, A., Křetínský, M., Strejček, J.: Compositional approach to suspension and other improvements to LTL translation. In: Bartocci, E., Ramakrishnan, C.R. (eds.) SPIN 2013. LNCS, vol. 7976, pp. 81–98. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  4. 4.
    Blahoudek, F., Duret-Lutz, A., Křetínský, M., Strejček, J.: Is there a best Büchi automaton for explicit model checking? In: SPIN 2014, pp. 68–76. ACM (2014)Google Scholar
  5. 5.
    Dax, C., Eisinger, J., Klaedtke, F.: Mechanizing the powerset construction for restricted classes of \(\omega \)-automata. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 223–236. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  6. 6.
    Duret-Lutz, A.: LTL translation improvements in Spot 1.0. Int. J. Crit. Comput. Based Syst. 5(1/2), 31–54 (2014)CrossRefGoogle Scholar
  7. 7.
    Edelkamp, S., Lluch Lafuente, A., Leue, S.: Directed explicit model checking with HSF-SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, p. 57. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  8. 8.
    Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. STTT 5(2–3), 247–267 (2004)CrossRefGoogle Scholar
  9. 9.
    Etessami, K., Holzmann, G.J.: Optimizing büchi automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 153–167. Springer, Heidelberg (2000) CrossRefGoogle Scholar
  10. 10.
    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) CrossRefGoogle Scholar
  11. 11.
    Holzmann, G.J.: The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, Boston (2003) Google Scholar
  12. 12.
    Holzmann, G.J., Peled, D.A., Yannakakis, M.: On nested depth first search. In: SPIN 1996, vol. 32 of DIMACS. American Mathematical Society (1996)Google Scholar
  13. 13.
    Minato, S.: Fast generation of irredundant sum-of-products forms from binary decision diagrams. In: SASIMI 1992, pp. 64–73 (1992)Google Scholar
  14. 14.
    Pelánek, R.: BEEM: benchmarks for explicit model checkers. In: Bošnački, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 263–267. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  15. 15.
    Pnueli, A.: The temporal logic of programs. In: FOCS 1977, pp. 46–57. IEEE (1977)Google Scholar
  16. 16.
    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) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • František Blahoudek
    • 1
  • Alexandre Duret-Lutz
    • 2
  • Vojtěch Rujbr
    • 1
  • Jan Strejček
    • 1
  1. 1.Faculty of InformaticsMasaryk UniversityBrnoCzech Republic
  2. 2.LRDEEPITALe Kremlin-BicêtreFrance

Personalised recommendations