Temporal Logics in Computer Science
From MaRDI portal
Publication:2805273
DOI10.1017/CBO9781139236119zbMath1380.68003OpenAlexW3210476636MaRDI QIDQ2805273
Stéphane P. Demri, Martin Lange, Valentin F. Goranko
Publication date: 11 May 2016
Full work available at URL: https://doi.org/10.1017/cbo9781139236119
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Temporal logic (03B44)
Related Items
Equilibria for games with combined qualitative and quantitative objectives ⋮ Uniform interpolation from cyclic proofs: the case of modal mu-calculus ⋮ A focus system for the alternation-free \(\mu \)-calculus ⋮ The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games ⋮ Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Системы временной логики I: моменты, истории, деревья ⋮ Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ Unnamed Item ⋮ Branching-time logics and fairness, revisited ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ The tail-recursive fragment of timed recursive CTL ⋮ Time and Gödel: fuzzy temporal reasoning in PSPACE ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ UNDER LOCK AND KEY: A PROOF SYSTEM FOR A MULTIMODAL LOGIC ⋮ Unnamed Item ⋮ Interval vs. Point Temporal Logic Model Checking ⋮ Loop-type sequent calculi for temporal logic ⋮ Temporal logics with language parameters ⋮ ``Most of leads to undecidability: failure of adding frequencies to LTL ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability ⋮ On the expressive power of hybrid branching-time logics ⋮ Unnamed Item ⋮ On the complexity of resource-bounded logics ⋮ Temporal logics with language parameters ⋮ One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\) ⋮ Unnamed Item ⋮ Model checking for hybrid branching-time logics ⋮ Unnamed Item ⋮ Propositional Dynamic Logic for Hyperproperties ⋮ Unnamed Item ⋮ Alternating-time temporal logic ATL with finitely bounded semantics ⋮ \(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\) ⋮ Pardinus: a temporal relational model finder ⋮ Local higher-order fixpoint iteration ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
