A turn-based approach for qualitative time concurrent games

DOI10.1007/978-3-030-76983-3_5zbMATH Open1489.68160OpenAlexW3169429640MaRDI QIDQ2117153FDOQ2117153

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

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

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)

Cites Work

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

Cited In (2)

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

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)