scientific article
From MaRDI portal
Publication:2754084
zbMath0974.68527MaRDI QIDQ2754084
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Memoryless determinacy of parity and mean payoff games: a simple proof, Symmetric Strategy Improvement, Permissive strategies: from parity games to safety games, The mu-calculus and Model Checking, Graph Games and Reactive Synthesis, From Parity and Payoff Games to Linear Programming, Solving parity games in big steps, Parity game reductions, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Unnamed Item, Robust worst cases for parity games algorithms, An exponential lower bound for Zadeh's pivot rule, Universal algorithms for parity games and nested fixpoints, The Rabin index of parity games: its complexity and approximation, A Simple P-Matrix Linear Complementarity Problem for Discounted Games, A survey of stochastic \(\omega \)-regular games, Solving parity games by a reduction to SAT, Improved complexity analysis of quasi-polynomial algorithms solving parity games, Computing Game Values for Crash Games, Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games, Value Iteration, Model checking in the modal \(\mu \)-calculus and generic solutions, Graph operations on parity games and polynomial-time algorithms, On strategy improvement algorithms for simple stochastic games, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, A superpolynomial lower bound for strategy iteration based on snare memorization, The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs, Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis, Improving Strategies via SMT Solving, Concurrent reachability games, Solving parity games via priority promotion, A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games, An exponential lower bound for Cunningham's rule, Unnamed Item, New deterministic algorithms for solving parity games, A Multi-Core Solver for Parity Games, Unnamed Item, Unnamed Item, Verification of reactive systems via instantiation of parameterised Boolean equation systems, A delayed promotion policy for parity games, Solving μ-Calculus Parity Games by Symbolic Planning, Solving Parity Games in Big Steps, Improving parity games in practice, Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time, Switching Graphs, Solving Parity Games Using an Automata-Based Algorithm, Solving Parity Games in Practice, Recursive algorithm for parity games requires exponential time, Model checking for hybrid logic, Combinatorial structure and randomized subexponential algorithms for infinite games, Games with winning conditions of high Borel complexity
