Timed Parity Games: Complexity and Robustness

DOI10.1007/978-3-540-85778-5_10zbMath1171.68527OpenAlexW1760494660MaRDI QIDQ5900485

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

Publication date: 2 December 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://repository.ist.ac.at/506/1/1011.0688%283%29.pdf

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Formal languages and automata (68Q45)

Related Items (3)

Robust Specification of Real Time Components ⋮ Robust synthesis for real-time systems ⋮ Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems

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