Publication:3219755
From MaRDI portal
zbMath0556.68005MaRDI QIDQ3219755
Robert S. Streett, E. Allen Emerson
Publication date: 1984
dynamic logic; mu-calculus; decision procedure; PDL; small model theorem; Game Logic; looping construct; propositional logic of programs
03B60: Other nonclassical logic
68Q65: Abstract data types; algebraic specification
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Deciding the unguarded modal -calculus, Alternating automata: Unifying truth and validity checking for temporal logics, A dynamic deontic logic for complex contracts, On the modal definability of simulability by finite transitive models, SnS can be modally characterized, 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, Reasoning about nondeterministic and concurrent actions: A process algebra approach, Mathematical modal logic: A view of its evolution, Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\), Satisfiability of Linear Time Mu-Calculus on Finite Traces, Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting, The Modal μ-Calculus Caught Off Guard, The mu-calculus and Model Checking
