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.
LTL Store: Repository of LTL formulae from literature and case studies
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
This continuously extended technical report collects and compares commonly used formulae from the literature and provides them in a machine readable way.
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.