A turn-based approach for qualitative time concurrent games

DOI10.1007/978-3-030-76983-3_5MaRDI QIDQ2117153zbMATH OpenOpenAlexFDO

Authors Serge Haddad, Didier Lime, Olivier H. Roux

Publication date 21 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-76983-3_5

Mathematics Subject Classification ID

Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Timed Parity Games: Complexity and Robustness
• Timed Parity Games: Complexity and Robustness
• Qualitative concurrent parity games
• Qualitative analysis of concurrent mean-payoff games
• Qualitative concurrent parity games: bounded rationality

Cites work

• scientific article; zbMATH DE number 1863183 (Why is no real title available?)
• Concurrent reachability games
• Logical time control of concurrent DES
• On the synthesis of discrete controllers for timed systems
• On the synthesis of strategies in infinite games
• Reachability-Time Games on Timed Automata
• Strategy improvement for concurrent reachability and turn-based stochastic safety games
• Supervisory Control of a Class of Discrete Event Processes
• The element of surprise in timed games.

Cited in

(2)

• Timed Parity Games: Complexity and Robustness
• On timed alternating simulation for concurrent timed games

Describes a project that uses

Uses Software

• UPPAAL TIGA

This page was built for publication: A turn-based approach for qualitative time concurrent games

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