Alternative semantics for temporal logics

DOI10.1016/0304-3975(83)90082-8zbMath0559.68050OpenAlexW2062458205MaRDI QIDQ2265815

E. Allen Emerson

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90082-8

zbMATH Keywords

limit closuretemporal logicsallowed sets of computation pathsfusion closureR-generable pathssuffix closure

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (18)

Time-extraction for temporal logic -- logic programming and local process time ⋮ Spanning the spectrum from safety to liveness ⋮ Infinite unfair shuffles and associativity ⋮ Safety, liveness and fairness in temporal logic ⋮ Interleaving set temporal logic ⋮ TTL : a formalism to describe local and global properties of distributed systems ⋮ The complexity of reasoning about knowledge and time. I: Lower bounds ⋮ Unnamed Item ⋮ Axiomatising extended computation tree logic ⋮ Expressiveness and succinctness of a logic of robustness ⋮ A tableau-based decision procedure for CTL\(^*\) ⋮ Branching versus linear logics yet again ⋮ Reasoning about programs by exploiting the environment ⋮ Axiomatising extended computation tree logic ⋮ \(R\)-generability, and definability in branching time logics ⋮ Verification of distributed programs using representative interleaving sequences ⋮ Decision procedures and expressiveness in the temporal logic of branching time ⋮ A Labeled Natural Deduction System for a Fragment of CTL *

Cites Work

• The temporal semantics of concurrent programs
• Process logic: Expressiveness, decidability, completeness
• Formalization of Properties of Functional Programs
• Unnamed Item
• Unnamed Item

This page was built for publication: Alternative semantics for temporal logics