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.
International Journal of Foundations of Computer Science 24(6), 847–862 (2013)
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.