Journal of the ACM · 2020 · 19 citations · 30 references
ComputingComputer ScienceMathematicsAlgorithmsFormal MethodsTranslation TheoryAutomata TheoryFinite AutomataFinite-state MachinesModel TheoryTemporal LogicAutomata ConstructionBüchi AutomataCompositional VerificationFinite Automata TheoryLinear Temporal LogicMaster TheoremNondeterministic Finite Automata
We present a unified translation of linear temporal logic (LTL) formulas into deterministic Rabin automata (DRA), limit-deterministic Büchi automata (LDBA), and nondeterministic Büchi automata (NBA). The translations yield automata of asymptotically optimal size (double or single exponential, respectively). All three translations are derived from one single Master Theorem of purely logical nature. The Master Theorem decomposes the language of a formula into a positive Boolean combination of languages that can be translated into ω-automata by elementary means. In particular, Safra’s, ranking, and breakpoint constructions used in other translations are not needed. We further give evidence that this theoretical clean and compositional approach does not lead to large automata per se and in fact in the case of DRAs yields significantly smaller automata compared to the previously known approach using determinisation of NBAs.
30
The temporal logic of programs
Amir Pnueli · 1977 · 5.7K citations
On the synthesis of a reactive module
Amir Pnueli, Roni Rosner · 1989 · 1.4K citations · Full text
Derivatives of Regular Expressions
Janusz Brzozowski · Journal of the ACM · 1964 · 931 citations · Full text
On the temporal analysis of fairness
Dov M. Gabbay, Amir Pnueli, Saharon Shelah et al. · 1980 · 731 citations