Pages that link to "Item:Q1119630"
From MaRDI portal
The following pages link to An automata theoretic decision procedure for the propositional mu- calculus (Q1119630):
Displaying 50 items.
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- Games for the \(\mu\)-calculus (Q671352) (← links)
- Completions of \(\mu \)-algebras (Q925850) (← links)
- Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
- On modal \(\mu \)-calculus and Gödel-Löb logic (Q1015480) (← links)
- A decidable class of problems for control under partial observation (Q1041809) (← links)
- Local model checking for infinite state spaces (Q1190489) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus (Q1325848) (← links)
- Proving properties of dynamic process networks (Q1383156) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- Program schemata vs. automata for decidability of program logics (Q1392141) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Monadic second-order logic on tree-like structures (Q1606130) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
- On modal \(\mu\)-calculus and non-well-founded set theory (Q1771199) (← links)
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. (Q1854336) (← links)
- Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)
- Inductive synthesis of recursive processes from logical properties (Q1854392) (← links)
- Pushdown processes: Games and model-checking (Q1854405) (← links)
- Tarskian set constraints (Q1854523) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- Bounded game-theoretic semantics for modal mu-calculus (Q2105468) (← links)
- Compositional verification of concurrent systems by combining bisimulations (Q2147689) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Is there a ``Hilbert thesis''? (Q2631647) (← links)
- From Parity Games to Circular Proofs (Q2842563) (← links)
- Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting (Q2866731) (← links)
- Local Model Checking in a Logic for True Concurrency (Q2988383) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures for Modal and Hybrid Logics (Q3010369) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Two Ways to Common Knowledge (Q3185764) (← links)
- The Proof Theory of Common Knowledge (Q3299587) (← links)
- The modal<i>μ</i>-calculus hierarchy over restricted classes of transition systems (Q3655261) (← links)
- A selection property of the boolean $\mu $-calculus and some of its applications (Q4380557) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- A tableau proof system for a mazurkiewicz trace logic with fixpoints (Q4610334) (← links)
- A Note on Negative Tagging for Least Fixed-Point Formulae (Q4943549) (← links)
- Logical questions concerning the <i>μ</i>-calculus: Interpolation, Lyndon and Łoś-Tarski (Q4953222) (← links)
- (Q5002827) (← links)
- (Q5021004) (← links)
- Automata, Logic and Games for the $$\lambda $$ -Calculus (Q5224488) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- Alternation-free weighted mu-calculus: decidability and completeness (Q5971405) (← links)
