Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata.
Simon JantschMichael NorrishPublished in: ITP (2018)
Keyphrases
- model checking
- deterministic automata
- finite automata
- finite state
- timed automata
- automata theoretic
- temporal logic
- finite state machines
- cellular automata
- regular expressions
- probabilistic automata
- lattice gas
- query language
- tree automata
- database
- turing machine
- formal verification
- linear time temporal logic
- linear temporal logic
- finite state automata
- search algorithm
- decision trees
- information systems