Fast Translation from LTL to Büchi Automata via Non-transition-based Automata
In model checking, properties are typically defined in linear temporal logic (LTL) and are translated into non-deterministic Büchi automata (NBA). In this paper, we propose a new, efficient translation method that is different from those used in LTL2BA, Spot and LTL3BA. Our method produces non-transition-based generalised Büchi automata (GBA) as an intermediate object, whereas LTL2BA, Spot, and LTL3BA use transition-based generalised Büchi automata (TGBA). Our method enables fast conversion because the data structure representing the object is simpler than that used in conversions via TGBA. Furthermore, we have developed techniques to reduce the number of states, similar to techniques that have heretofore only been available for conversions via TGBA. We also propose a technique to suppress the increase in the number of states that normally occurs while GBA is converted into NBA, using characteristics of strongly connected components of the GBA. We implemented our method with these techniques and experimentally compared our method with LTL2BA, Spot, and LTL3BA, which are the fastest translators to date. Our conversion method was much faster than LTL2BA and Spot, and was competitive with LTL3BA. In addition, the number of states in the NBA resulting from our method was comparable to that produced by LTL2BA, Spot, and LTL3BA.
Unable to display preview. Download preview PDF.
- 2.Aoshima, T., Sakuma, K., Yonezaki, N.: An efficient verification procedure supporting evolution of reactive system specifications. In: Proc. of the 4th International Workshop on Principles of Software Evolution, pp. 182–185. ACM (2001)Google Scholar
- 3.Aoshima, T., Yonezaki, N.: Verification of reactive system specification with outer event conditional formula. In: International Symposium on Principles of Software Evolution (ISPSE2000), pp. 195–199 (2000)Google Scholar
- 5.Duret-Lutz, A.: LTL translation improvements in Spot. In: Proc. of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems, VECoS 2011, pp. 72–83. British Computer Society (2011)Google Scholar
- 6.Duret-Lutz, A., Poitrenaud, D.: Spot: An extensible model checking library using transition-based generalized Büchi automata. In: Proc. of MASCOTS 2004, pp. 76–83. IEEE Computer Society (2004)Google Scholar
- 9.Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Protocol Specification Testing and Verification, pp. 3–18. Chapman & Hall (1995)Google Scholar
- 12.Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: Formal Methods in Computer Aided Design, FMCAD 2006, pp. 117–124 (2006)Google Scholar
- 13.Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL 1989, pp. 179–190 (1989)Google Scholar