Two-player boundedness counter games

DOI10.4230/LIPICS.CONCUR.2022.21MaRDI QIDQ6587129zbMATH OpenFDO

Authors Emmanuel Filiot, Edwin Hamel-de le Court

Publication date 13 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2022.21

zbMATH Keywords

boundedness objectivescontroller synthesiscounter gamesgame theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• On the complexity of counter reachability games
• Solving counter parity games
• Trading bounds for memory in games with counters
• On the Complexity of Counter Reachability Games
• Infinite-state games with finitary conditions

Cited in

(1)

• Process equivalence problems as energy games

This page was built for publication: Two-player boundedness counter games

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