Fast LTL to Büchi automata translation. We present an algorithm to generate Büchi automata from Linear Time Logic (LTL) formulae. This algorithm generates a very weak alternating co-Büchi automaton and then transforms it into a Büchi automaton, using a generalized Büchi automaton as an intermediate step. Each automaton is simplified on-the-fly in order to save memory and time. As usual we simplify the LTL formula before any treatment. We implemented this algorithm and compared it with Spin: the experiments show that our algorithm is much more efficient than Spin. The criteria of comparison are the size of the resulting automaton, the time of the computation and the memory used. Our implementation is available on the web at the following address:

References in zbMATH (referenced in 84 articles )

Showing results 1 to 20 of 84.
Sorted by year (citations)

1 2 3 4 5 next

  1. Faymonville, Peter; Zimmermann, Martin: Parametric linear dynamic logic (2017)
  2. Hutschenreiter, Lisa; Peñaloza, Rafael: An automata view to goal-directed methods (2017)
  3. Tomita, Takashi; Ueno, Atsushi; Shimakawa, Masaya; Hagihara, Shigeki; Yonezaki, Naoki: Safraless LTL synthesis considering maximal realizability (2017)
  4. Unel, Gulay; Toman, David: Logic programming approach to automata-based decision procedures (2017)
  5. Duan, Zhenhua; Tian, Cong; Zhang, Nan: A canonical form based decision procedure and model checking approach for propositional projection temporal logic (2016)
  6. Esparza, Javier; Křetínský, Jan; Sickert, Salomon: From LTL to deterministic automata. A safraless compositional approach (2016)
  7. Molnár, Vince; Vörös, András; Darvas, Dániel; Bartha, Tamás; Majzik, István: Component-wise incremental LTL model checking (2016)
  8. Unel, Gulay: Incremental reasoning on monadic second-order logics with logic programming (2016)
  9. Yang, Fan; Yang, Guowu; Hao, Yujie: The modeling library of eavesdropping methods in quantum cryptography protocols by model checking (2016)
  10. Kirchner, Florent; Kosmatov, Nikolai; Prevosto, Virgile; Signoles, Julien; Yakobowski, Boris: Frama-C: a software analysis perspective (2015) ioport
  11. Peleska, Jan: Translating testing theories for concurrent systems (2015)
  12. Shan, Laixiang; Qin, Jun; Chen, Mingshi; Qin, Zheng: Degeneralization algorithm for generation of Büchi automata based on contented situation (2015)
  13. Taha, Safouan; Julliand, Jacques; Dadeau, Frédéric; Castillos, Kalou Cabrera; Kanso, Bilal: A compositional automata-based semantics and preserving transformation rules for testing property patterns (2015)
  14. Abdulla, Parosh Aziz; Chen, Yu-Fang; Holík, Lukáš; Vojnar, Tomáš: Mediating for reduction (on minimizing alternating Büchi automata) (2014)
  15. Baader, Franz; Lippmann, Marcel: Runtime verification using the temporal description logic $\mathcalALC$-LTL revisited (2014)
  16. Beyene, Tewodros; Chaudhuri, Swarat; Popeea, Corneliu; Rybalchenko, Andrey: A constraint-based approach to solving games on infinite graphs (2014)
  17. Ding, Xuchu; Lazar, Mircea; Belta, Calin: LTL receding horizon control for finite deterministic systems (2014)
  18. Komárková, Zuzana; Křetínský, Jan: Rabinizer 3: safraless translation of LTL to small deterministic automata (2014)
  19. Seki, Hirohisa: Extending co-logic programs for branching-time model checking (2014)
  20. Wimmer, Ralf; Jansen, Nils; Ábrahám, Erika; Katoen, Joost-Pieter; Becker, Bernd: Minimal counterexamples for linear-time probabilistic verification (2014)

1 2 3 4 5 next