A multi-encoding approach for LTL symbolic satisfiability checking
FM'11 Proceedings of the 17th international conference on Formal methods
LTL translation improvements in spot
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
LTL to büchi automata translation: fast and more deterministic
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
GOAL for games, omega-automata, and logics
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
LTL translation improvements in Spot 1.0
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
In this paper we calculate the minimal number of states of Buchi automata which encode some classes of linear temporal logic (LTL) formulas that are frequently used in model checking. Our results may be used for verification of the quality of algorithms which automatically translate LTL formulas into Buchi automata and for improving the quality and speed of such translators. In the last section of this paper we compare our lower-bound estimations to Buchi automata generated by two currently used translators: LTL2BA and SPOT.