scientific article
From MaRDI portal
Publication:3341881
zbMath0549.68020MaRDI QIDQ3341881
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 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
CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus, Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints, A branching time logic with past operators, The complementation problem for Büchi automata with applications to temporal logic, Functional Specification of Hardware via Temporal Logic, Trace Semantics for IPDL, On the Model Checking Problem for Some Extension of CTL*, Uniform inevitability is tree automaton ineffable, Satisfiability of ECTL* with Tree Constraints, Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints, Axiomatising extended computation tree logic, Expressiveness of propositional projection temporal logic with star, Axiomatising extended computation tree logic, Arity hierarchy for temporal logics, \(R\)-generability, and definability in branching time logics, From Philosophical to Industrial Logics, From Monadic Logic to PSL, Decidability and Expressivity of Ockhamist Propositional Dynamic Logics, Computation paths logic: An expressive, yet elementary, process logic, An infinite hierarchy of temporal logics over branching time