Efficient On-the-Fly Algorithms for Partially Observable Timed Games

DOI10.1007/978-3-540-75454-1_3MaRDI QIDQ3510829zbMATH OpenOpenAlexFDO

Authors Franck Cassez

Publication date 3 July 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-75454-1_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of game theory (91A80) Discrete event control/observation systems (93C65)

Recommendations

• CONCUR 2005 – Concurrency Theory
• Probabilistic robust timed games
• A faster algorithm for solving one-clock priced timed games
• Stochastic timed games revisited
• Automata, Languages and Programming
• Reachability-Time Games on Timed Automata
• Timed Parity Games: Complexity and Robustness
• Timed Parity Games: Complexity and Robustness
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Optimal time-abstract schedulers for CTMDPs and Markov games

Cited in

(9)

• Compositional Control Synthesis for Partially Observable Systems
• On-the-Fly Synthesis for Strictly Alternating Games
• On timed alternating simulation for concurrent timed games
• Efficient on-the-fly algorithm for checking alternating timed simulation
• Timed Control with Observation Based and Stuttering Invariant Strategies
• Computing Weakest Strategies for Safety Games of Imperfect Information
• CONCUR 2005 – Concurrency Theory
• Taming large bounds in synthesis from bounded-liveness specifications
• Lazy abstraction-based controller synthesis

Describes a project that uses

Uses Software

• UPPAAL TIGA
• CMC
• Kronos

This page was built for publication: Efficient On-the-Fly Algorithms for Partially Observable Timed Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510829)