A Compositional and Unified Translation of LTL into ω-Automata.
Benedikt SeidlSalomon SickertPublished in: Arch. Formal Proofs (2019)
Keyphrases
- deterministic automata
- temporal logic
- automata theoretic
- finite automata
- model checking
- machine translation
- finite state
- cellular automata
- query translation
- regular expressions
- finite state machines
- linear temporal logic
- language resources
- unified model
- probabilistic automata
- bounded model checking
- linear time temporal logic
- tree automata
- finite state automata
- turing machine
- neural network
- cross language
- natural language processing
- machine learning