A new algorithm generates unambiguous Büchi automata from LTL formulas via disambiguation of very weak alternating automata, including optimizations and LTL simplifications for smaller sizes.
In: Proceedings of the World Congress on Formal Methods in the Development of Computing Systems (FM)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
From LTL to Unambiguous B\"uchi Automata via Disambiguation of Alternating Automata
A new algorithm generates unambiguous Büchi automata from LTL formulas via disambiguation of very weak alternating automata, including optimizations and LTL simplifications for smaller sizes.