Probabilistic Robust Timed Games

DOI10.1007/978-3-662-44584-6_15zbMath1417.68088OpenAlexW2886218976MaRDI QIDQ3190118

Youssouf Oualhadj, Ocan Sankur, Pierre-Alain Reynier

Publication date: 15 September 2014

Published in: CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44584-6_15

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Expected reachability-time games ⋮ Timed Symbolic Dynamics

This page was built for publication: Probabilistic Robust Timed Games