The following pages link to (Q3219755):
Displaying 17 items.
- A dynamic deontic logic for complex contracts (Q444496) (← links)
- On the modal definability of simulability by finite transitive models (Q763328) (← links)
- SnS can be modally characterized (Q914397) (← links)
- Uniform inevitability is tree automaton ineffable (Q1108048) (← links)
- A finite model theorem for the propositional \(\mu\)-calculus (Q1117213) (← links)
- An automata theoretic decision procedure for the propositional mu- calculus (Q1119630) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) (Q1989347) (← links)
- Bounded game-theoretic semantics for modal mu-calculus (Q2105468) (← links)
- Satisfiability of Linear Time Mu-Calculus on Finite Traces (Q2817904) (← links)
- Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting (Q2866731) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach (Q5079769) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
