Reachability-Time Games on Timed Automata

DOI10.1007/978-3-540-73420-8_72zbMath1171.68528arXiv0907.3414OpenAlexW2951439219MaRDI QIDQ5428863

Ashutosh Trivedi, Marcin Jurdziński

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (15)

Expected reachability-time games ⋮ Automata-theoretic decision of timed games ⋮ Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems ⋮ A survey of timed automata for the development of real-time systems ⋮ Optimal controller synthesis for timed systems ⋮ Optimal Reachability in Divergent Weighted Timed Games ⋮ Concavely-Priced Timed Automata ⋮ Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets ⋮ Timed Basic Parallel Processes ⋮ On subgame perfect equilibria in turn-based reachability timed games ⋮ A menagerie of timed automata ⋮ Unnamed Item ⋮ On Reachability Games of Ordinal Length ⋮ Symbolic Approximation of Weighted Timed Games ⋮ A turn-based approach for qualitative time concurrent games

This page was built for publication: Reachability-Time Games on Timed Automata