Timed Parity Games: Complexity and Robustness

DOI10.2168/LMCS-7(4:8)2011zbMath1237.68112arXiv1011.0688MaRDI QIDQ5895527

Krishnendu Chatterjee, Vinayak S. Prabhu, Thomas A. Henzinger

Publication date: 2 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.0688

zbMATH Keywords

timed automatarobust timed controltimed parity games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45)

Related Items (7)

Differential Game Logic ⋮ Shrinking timed automata ⋮ Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems ⋮ Unnamed Item ⋮ Robust reachability in timed automata and games: a game-based approach ⋮ Timed games with bounded window parity objectives ⋮ Timed network games

This page was built for publication: Timed Parity Games: Complexity and Robustness