Pages that link to "Item:Q5941205"

The following pages link to On model checking for the \(\mu\)-calculus and its fragments (Q5941205):

Displaying 50 items.

• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) (Q293426) (← links)
• Logic programming approach to automata-based decision procedures (Q347398) (← links)
• Solving parity games by a reduction to SAT (Q414902) (← links)
• The dag-width of directed graphs (Q444380) (← links)
• Effective cut-elimination for a fragment of modal mu-calculus (Q454366) (← links)
• Model checking in the modal \(\mu \)-calculus and generic solutions (Q633088) (← links)
• Games for the \(\mu\)-calculus (Q671352) (← links)
• Reduced models for efficient CCS verification (Q816205) (← links)
• Games with winning conditions of high Borel complexity (Q817850) (← links)
• A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
• Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
• Strategy logic (Q979080) (← links)
• The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
• Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
• Fast and simple nested fixpoints (Q1350911) (← links)
• Program schemata vs. automata for decidability of program logics (Q1392141) (← links)
• A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
• A gap property of deterministic tree languages. (Q1401364) (← links)
• Parity game reductions (Q1656552) (← links)
• Solving parity games via priority promotion (Q1742991) (← links)
• Energy parity games (Q1758152) (← links)
• Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
• Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
• Memoryless determinacy of parity and mean payoff games: a simple proof (Q1884982) (← links)
• Model checking games for the quantitative \(\mu \)-calculus (Q1959394) (← links)
• On logics with two variables (Q1960419) (← links)
• Quasipolynomial computation of nested fixpoints (Q2044189) (← links)
• Certifying proofs for SAT-based model checking (Q2058379) (← links)
• Robust worst cases for parity games algorithms (Q2182730) (← links)
• On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
• Fixpoint logics over hierarchical structures (Q2429724) (← links)
• A superpolynomial lower bound for strategy iteration based on snare memorization (Q2446310) (← links)
• A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
• When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus (Q2643076) (← links)
• Alternating Context-Free Languages and Linear Time μ-Calculus with Sequential Composition (Q2842604) (← links)
• (Q2842876) (← links)
• Parameterized Algorithms for Parity Games (Q2946404) (← links)
• Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
• Local Model Checking in a Logic for True Concurrency (Q2988383) (← links)
• Extracting Winning Strategies in Update Games (Q3091450) (← links)
• Recursive algorithm for parity games requires exponential time (Q3117548) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
• (Q3384167) (← links)
• An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
• Facets of Synthesis: Revisiting Church’s Problem (Q3617717) (← links)
• <i>μ</i>-Bicomplete Categories and Parity Games (Q4787834) (← links)
• Permissive strategies: from parity games to safety games (Q4800258) (← links)
• Switching Graphs (Q4982090) (← links)
• (Q5015267) (← links)