A Better Translation From LTL to Transition-Based Generalized Büchi Automata
Translating linear temporal logic (LTL) formulas into Büchi automata is one of the most important aspects of LTL model checking. Certain successful algorithms, such as LTL2BA and SPOT, first translate an LTL formula into a transition-based generalized Büchi automaton (TGBA) a...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8106768/ |