LTL can be translated to self-loop alternating automata with Emerson-Lei acceptance using F and G state-merging, yielding smaller automata than traditional Büchi/co-Büchi SLAA.
LTL to B¨ uchi Au- tomata Translation: Fast and More Deterministic
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
LTL to Smaller Self-Loop Alternating Automata and Back
LTL can be translated to self-loop alternating automata with Emerson-Lei acceptance using F and G state-merging, yielding smaller automata than traditional Büchi/co-Büchi SLAA.