scientific article; zbMATH DE number 1500523
From MaRDI portal
Publication:4501540
zbMATH Open0962.68111MaRDI QIDQ4501540FDOQ4501540
Authors: Marcin Jurdziński 
Publication date: 4 September 2000
Title of this publication is not available (Why is that?)
Recommendations
2-person games (91A05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cited In (only showing first 100 items - show all)
- Optimal bounds in parametric LTL games
- Inf-datalog, Modal Logic and Complexities
- Games for verification: Algorithmic issues
- Improving parity games in practice
- Synthesis from component libraries with costs
- Automata theory and model checking
- A superpolynomial lower bound for strategy iteration based on snare memorization
- The Descriptive Complexity of Parity Games
- Three notes on the complexity of model checking fixpoint logic with chop
- A survey of stochastic \(\omega \)-regular games
- On the universal and existential fragments of the \(\mu\)-calculus
- Solving parity games by a reduction to SAT
- A Multi-Core Solver for Parity Games
- The Theory of Universal Graphs for Infinite Duration Games
- Model checking games for the quantitative \(\mu \)-calculus
- Controlling a population
- Solving parity games via priority promotion
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Looking at mean payoff through foggy windows
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- Graph operations on parity games and polynomial-time algorithms
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- New deterministic algorithms for solving parity games
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- An \(O(n^2)\) time algorithm for alternating Büchi games
- Entanglement and the complexity of directed graphs
- Parity game reductions
- The mu-calculus and Model Checking
- Synthesis of Reactive(1) designs
- Permissive strategies: from parity games to safety games
- Solving parity games using an automata-based algorithm
- Undirected Graphs of Entanglement 2
- Generic weakest precondition semantics from monads enriched with order
- A delayed promotion policy for parity games
- Multi-buffer simulations: decidability and complexity
- Title not available (Why is that?)
- Polynomial-time under-approximation of winning regions in parity games
- Model Checking Games
- The Rabin index of parity games: its complexity and approximation
- Games on Multi-stack Pushdown Systems
- Quasipolynomial computation of nested fixpoints
- Graph Games and Reactive Synthesis
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- Down the Borel hierarchy: solving Muller games via safety games
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- Title not available (Why is that?)
- Dicing on the Streett
- Faster algorithms for mean-payoff games
- Solving parity games in big steps
- From Parity and Payoff Games to Linear Programming
- On modal \(\mu\)-calculus with explicit interpolants
- Solving Parity Games in Big Steps
- Parametrized automata simulation and application to service composition
- Concurrent reachability games
- Model checking for hybrid logic
- Parameterized Algorithms for Parity Games
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- Strategy logic
- Justifications and a reconstruction of parity game solving algorithms
- Bridging the gap between fair simulation and trace inclusion
- A CSP-Based Approach for Solving Parity Game
- Disjunctive form and the modal \(\mu\) alternation hierarchy
- Qualitative analysis of concurrent mean-payoff games
- Solving parity games in practice
- Value Iteration
- Switching graphs
- Fixpoint logics over hierarchical structures
- Games with winning conditions of high Borel complexity
- Symmetric strategy improvement
- Memoryless determinacy of parity and mean payoff games: a simple proof
- Combinatorial structure and randomized subexponential algorithms for infinite games
- Quantitative fair simulation games
- Alternating traps in Muller and parity games
- Succinct progress measures for solving parity games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding Parity Games in Quasi-polynomial Time
- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
- Bounded game-theoretic semantics for modal mu-calculus
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved complexity analysis of quasi-polynomial algorithms solving parity games
- Dissecting \texttt{ltlsynt}
- Computing Game Values for Crash Games
- Title not available (Why is that?)
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Combinations of Qualitative Winning for Stochastic Parity Games
- Games on Higher Order Multi-stack Pushdown Systems
- Window parity games: an alternative approach toward parity games with time bounds
- Parity games with weights
- Quasipolynomial set-based symbolic algorithms for parity games
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- The fixpoint-iteration algorithm for parity games
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Title not available (Why is that?)
- A delayed promotion policy for parity games
- Priority promotion with Parysian flair
- Matching in security-by-contract for mobile code
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)
