scientific article
From MaRDI portal
Publication:3219755
zbMath0556.68005MaRDI QIDQ3219755
Robert S. Streett, E. Allen Emerson
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamic logicmu-calculusdecision procedurePDLsmall model theoremGame Logiclooping constructpropositional logic of programs
Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (17)
The mu-calculus and Model Checking ⋮ Uniform inevitability is tree automaton ineffable ⋮ A finite model theorem for the propositional \(\mu\)-calculus ⋮ An automata theoretic decision procedure for the propositional mu- calculus ⋮ Deciding the unguarded modal -calculus ⋮ A dynamic deontic logic for complex contracts ⋮ SnS can be modally characterized ⋮ Mathematical modal logic: A view of its evolution ⋮ The Modal μ-Calculus Caught Off Guard ⋮ Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) ⋮ Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach ⋮ Satisfiability of Linear Time Mu-Calculus on Finite Traces ⋮ Reasoning about nondeterministic and concurrent actions: A process algebra approach ⋮ On the modal definability of simulability by finite transitive models ⋮ Alternating automata: Unifying truth and validity checking for temporal logics ⋮ Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting ⋮ Bounded game-theoretic semantics for modal mu-calculus
This page was built for publication:
