From linear time to branching time
From MaRDI portal
Publication:5277722
DOI10.1145/1055686.1055689zbMath1367.68195OpenAlexW2020617153MaRDI QIDQ5277722
Moshe Y. Vardi, Orna Kupferman
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1055686.1055689
Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items
From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ \textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes ⋮ The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity ⋮ New Optimizations and Heuristics for Determinization of Büchi Automata ⋮ Certifying inexpressibility ⋮ The Quest for a Tight Translation of Büchi to co-Büchi Automata ⋮ Automata-Theoretic Model Checking Revisited ⋮ On Repetition Languages ⋮ Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems ⋮ TYPENESS FOR ω-REGULAR AUTOMATA ⋮ Unnamed Item ⋮ Relating word and tree automata ⋮ Unnamed Item ⋮ How Deterministic are Good-For-Games Automata?
