On-the-fly solving for symbolic parity games

DOI10.1007/978-3-030-99527-0_8MaRDI QIDQ6535612zbMATH OpenFDO

Authors Maurice Laveaux, Wieger Wesselink, T. A. C. Willemse

Publication date 1 February 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-99527-0_8

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Solving parity games in practice
• Solving parity games: explicit vs symbolic
• Partial solvers for generalized parity games
• Solving parity games via priority promotion
• Solving parity games via priority promotion

Cites work

• A comparison of BDD-based parity game solvers
• Analysing the BKE-security protocol with CRL
• Deciding parity games in quasipolynomial time
• Efficient on-the-fly model-checking for regular alternation-free -calculus
• Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
• Fatal Attractors in Parity Games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Model checking a cache coherence protocol of a Java DSM implementation
• Model-checking processes with data
• Parameterised Boolean equation systems
• Proof graphs for parameterised Boolean equation systems
• Solving parity games via priority promotion
• Solving parity games: explicit vs symbolic
• Succinct progress measures for solving parity games

Cited in

(2)

• Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
• Symbolic verification and control of continuous-time systems via \textit{AP}-observation automata

This page was built for publication: On-the-fly solving for symbolic parity games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535612)