From LTL to Unambiguous Büchi Automata via Disambiguation of Alternating Automata.
Simon JantschDavid MüllerChristel BaierJoachim KleinPublished in: FM (2019)
Keyphrases
- deterministic automata
- finite automata
- cellular automata
- model checking
- finite state
- finite state machines
- lattice gas
- natural language
- regular expressions
- temporal logic
- tree automata
- timed automata
- finite state automata
- probabilistic automata
- bounded model checking
- automata theoretic
- turing machine
- co occurrence
- knowledge base