Cooking Your Own Parity Game Preorders Through Matching Plays

DOI10.1142/S012905411841006XOpenAlexW2810652935MaRDI QIDQ3177339

Maciej Gazda, Tim A. C. Willemse

Publication date: 24 July 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905411841006x

zbMATH Keywords

modal logicparity gamesbisimulations

Mathematics Subject Classification ID

Games involving graphs (91A43) Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Unnamed Item
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Games for synthesis of controllers with partial observation.
• On Parity Game Preorders and the Logic of Matching Plays
• Complementation of Coalgebra Automata
• Consistent Consequence for Boolean Equation Systems
• A Cure for Stuttering Parity Games
• The Modal μ-Calculus Caught Off Guard
• Computing Stuttering Simulations
• Alternating-time temporal logic
• The Descriptive Complexity of Parity Games
• A deterministic subexponential algorithm for solving parity games
• Simulation Relations for Alternating Parity Automata and Parity Games
• Deciding parity games in quasipolynomial time
• Solving Parity Games in Big Steps
• Computer Aided Verification