scientific article; zbMATH DE number 1500523
From MaRDI portal
Publication:4501540
Recommendations
Cited in
(only showing first 100 items - show all)- Model checking games for the quantitative \(\mu \)-calculus
- The Descriptive Complexity of Parity Games
- Undirected Graphs of Entanglement 2
- A survey of stochastic \(\omega \)-regular games
- Parameterized Algorithms for Parity Games
- scientific article; zbMATH DE number 7447737 (Why is no real title available?)
- Games on Multi-stack Pushdown Systems
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- Quasipolynomial computation of nested fixpoints
- Optimal bounds in parametric LTL games
- Model Checking Games
- Memoryless determinacy of parity and mean payoff games: a simple proof
- Generic weakest precondition semantics from monads enriched with order
- Dicing on the Streett
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- Controlling a population
- Model checking for hybrid logic
- On modal \(\mu\)-calculus with explicit interpolants
- Looking at mean payoff through foggy windows
- scientific article; zbMATH DE number 7215285 (Why is no real title available?)
- Parity game reductions
- Graph Games and Reactive Synthesis
- Solving parity games by a reduction to SAT
- Solving parity games in practice
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- Disjunctive form and the modal \(\mu\) alternation hierarchy
- Fixpoint logics over hierarchical structures
- Faster algorithms for mean-payoff games
- Games with winning conditions of high Borel complexity
- On the universal and existential fragments of the \(\mu\)-calculus
- Synthesis from component libraries with costs
- Inf-datalog, Modal Logic and Complexities
- Games for verification: Algorithmic issues
- Switching graphs
- The Rabin index of parity games: its complexity and approximation
- Synthesis of Reactive(1) designs
- The mu-calculus and Model Checking
- Strategy logic
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Permissive strategies: from parity games to safety games
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- A Multi-Core Solver for Parity Games
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- The Theory of Universal Graphs for Infinite Duration Games
- Symmetric strategy improvement
- Improving parity games in practice
- Solving parity games using an automata-based algorithm
- Solving Parity Games in Big Steps
- Solving parity games via priority promotion
- Graph operations on parity games and polynomial-time algorithms
- Combinatorial structure and randomized subexponential algorithms for infinite games
- Qualitative analysis of concurrent mean-payoff games
- An \(O(n^2)\) time algorithm for alternating Büchi games
- Parametrized automata simulation and application to service composition
- Quantitative fair simulation games
- Concurrent reachability games
- Alternating traps in Muller and parity games
- Solving parity games in big steps
- Value Iteration
- Bridging the gap between fair simulation and trace inclusion
- A CSP-Based Approach for Solving Parity Game
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- A delayed promotion policy for parity games
- Multi-buffer simulations: decidability and complexity
- Entanglement and the complexity of directed graphs
- Succinct progress measures for solving parity games
- Justifications and a reconstruction of parity game solving algorithms
- From Parity and Payoff Games to Linear Programming
- A delayed promotion policy for parity games
- Down the Borel hierarchy: solving Muller games via safety games
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- Polynomial-time under-approximation of winning regions in parity games
- Automata theory and model checking
- Three notes on the complexity of model checking fixpoint logic with chop
- A superpolynomial lower bound for strategy iteration based on snare memorization
- Improved complexity analysis of quasi-polynomial algorithms solving parity games
- Efficient Algorithms for Omega-Regular Energy Games
- Computing Game Values for Crash Games
- Dissecting \texttt{ltlsynt}
- Priority promotion with Parysian flair
- Parity games with weights
- Quasipolynomial set-based symbolic algorithms for parity games
- Lattice-theoretic progress measures and coalgebraic model checking
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- A constructive algorithm for max-min paths problems on energy networks
- Deciding Parity Games in Quasi-polynomial Time
- Combinations of Qualitative Winning for Stochastic Parity Games
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- Two variable vs. linear temporal logic in model checking and games
- Lazy Synthesis of Symbolic Output-Feedback Controllers for State-Based Safety Specifications
- The fixpoint-iteration algorithm for parity games
- Solving mean-payoff games via quasi dominions
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
- scientific article; zbMATH DE number 7453080 (Why is no real title available?)
- The alternation hierarchy in fixpoint logic with chop is strict too
- Recursive algorithm for parity games requires exponential time
- Games on Higher Order Multi-stack Pushdown Systems
- scientific article; zbMATH DE number 7649926 (Why is no real title available?)
- scientific article; zbMATH DE number 1810492 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501540)
