lbtt
lbtt - an LTL-to-Büchi translator testbench. lbtt is a tool for testing programs that translate formulas expressed in propositional linear temporal logic (LTL) into Büchi automata. The goal of the tool is to assist in the correct implementation of LTL-to-Büchi translation algorithms by providing an automated testing environment for LTL-to-Büchi translators. Additionally, the testing environment can be used for very basic profiling of different LTL-to-Büchi translators to evaluate their performance.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
Sorted by year (- Shan, Laixiang; Du, Xiaomin; Qin, Zheng: Efficient approach of translating LTL formulae into Büchi automata (2015)
- Shan, Laixiang; Qin, Jun; Chen, Mingshi; Qin, Zheng: Degeneralization algorithm for generation of Büchi automata based on contented situation (2015)
- Duret-Lutz, Alexandre: Manipulating LTL formulas using Spot 1.0 (2013)
- Li, Jianwen; Pu, Geguang; Zhang, Lijun; Wang, Zheng; He, Jifeng; Guldstrand Larsen, Kim: On the relationship between LTL normal forms and Büchi automata (2013)
- Rozier, Kristin Y.; Vardi, Moshe Y.: LTL satisfiability checking (2010) ioport
- Schimpf, Alexander; Merz, Stephan; Smaus, Jan-Georg: Construction of Büchi automata for LTL model checking verified in Isabelle/HOL (2009)
- Tauriainen, Heikki; Heljanko, Keijo: Testing LTL formula translation into Büchi automata (2002) ioport