Pages that link to "Item:Q5952907"

The following pages link to Alternating tree automata, parity games, and modal \(\mu\)-calculus (Q5952907):

Displaying 45 items.

• Solving parity games in big steps (Q340584) (← links)
• Improved model checking of hierarchical systems (Q418123) (← links)
• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
• On modal \(\mu \)-calculus and Gödel-Löb logic (Q1015480) (← links)
• The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs (Q1643142) (← links)
• Model-checking iterated games (Q1674862) (← links)
• Completeness for \(\mu\)-calculi: a coalgebraic approach (Q1731842) (← links)
• Solving parity games via priority promotion (Q1742991) (← links)
• Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
• On modal \(\mu\)-calculus and non-well-founded set theory (Q1771199) (← links)
• \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) (Q2011666) (← links)
• Improving parity games in practice (Q2043434) (← links)
• A focus system for the alternation-free \(\mu \)-calculus (Q2142090) (← links)
• Robust worst cases for parity games algorithms (Q2182730) (← links)
• Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
• Equivalence of probabilistic \(\mu\)-calculus and p-automata (Q2399249) (← links)
• Quantitative vs. weighted automata (Q2695484) (← links)
• Mu-depth 3 is more than 2: A game-theoretic proof (Q2719798) (← links)
• Refinement sensitive formal semantics of state machines with persistent choice (Q2810972) (← links)
• Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
• Modular games for coalgebraic fixed point logics (Q2873663) (← links)
• Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
• Emptiness Of Alternating Tree Automata Using Games With Imperfect Information (Q2963922) (← links)
• Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey (Q2970301) (← links)
• From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
• (Q3384167) (← links)
• Symmetric Strategy Improvement (Q3449491) (← links)
• Distributed Synthesis for Alternating-Time Logics (Q3510801) (← links)
• ATL* Satisfiability Is 2EXPTIME-Complete (Q3519515) (← links)
• Simulation Relations for Alternating Parity Automata and Parity Games (Q3617046) (← links)
• Tighter Bounds for the Determinisation of Büchi Automata (Q3617728) (← links)
• (Q3779749) (← links)
• Alternating Tree Automata and Parity Games (Q4412832) (← links)
• Expressiveness and succinctness of a logic of robustness (Q4586143) (← links)
• (Q4603451) (← links)
• Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
• More Precise Partition Abstractions (Q5452605) (← links)
• Model Checking for Action Abstraction (Q5452711) (← links)
• Complexity of Decision Problems for Mixed and Modal Specifications (Q5458354) (← links)
• Solving Parity Games in Big Steps (Q5458856) (← links)
• Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata (Q6541156) (← links)
• Priority promotion with Parysian flair (Q6627044) (← links)
• Size measures and alphabetic equivalence in the \(\mu \)-calculus (Q6649448) (← links)
• On the size of disjunctive formulas in the \(\mu\)-calculus (Q6649531) (← links)
• A compositional approach to parity games (Q6653762) (← links)