Parity game reductions
From MaRDI portal
Publication:1656552
DOI10.1007/s00236-017-0301-xzbMath1398.68337arXiv1603.06422OpenAlexW2311027344WikidataQ59514724 ScholiaQ59514724MaRDI QIDQ1656552
Jeroen J. A. Keiren, Tim A. C. Willemse, Sjoerd Cranen
Publication date: 10 August 2018
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.06422
Games involving topology, set theory, or logic (91A44) Specification and verification (program logics, model checking, etc.) (68Q60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Combinatorial structure and randomized subexponential algorithms for infinite games
- Invariants for parameterised Boolean equation systems
- Characterizing finite Kripke structures in propositional temporal logic
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Branching bisimilarity is an equivalence indeed!
- Games for synthesis of controllers with partial observation.
- Automata, logics, and infinite games. A guide to current research
- On Parity Game Preorders and the Logic of Matching Plays
- Static Analysis of Parity Games: Alternating Reachability Under Parity
- Branching Bisimulation Games
- Consistent Consequence for Boolean Equation Systems
- A Cure for Stuttering Parity Games
- Advanced automata minimization
- Büchi Automata Can Have Smaller Quotients
- Liveness Analysis for Parameterised Boolean Equation Systems
- A deterministic subexponential algorithm for solving parity games
- Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations
- Simulation Relations for Alternating Parity Automata and Parity Games
- Static Analysis Techniques for Parameterised Boolean Equation Systems
- Solving Parity Games in Practice
- Bisimulation, modal logic and model checking games
- Deciding the unguarded modal -calculus
- Fatal Attractors in Parity Games
- On the Ehrenfeucht-Fraïssé game in theoretical computer science
- Branching Bisimilarity Checking for PRS
- Simulation-based minimization
- Abstraction in Fixpoint Logic
- An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Solving Parity Games in Big Steps
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- On model checking for the \(\mu\)-calculus and its fragments
This page was built for publication: Parity game reductions
