Combining symbolic representations for solving timed games

DOI10.1007/978-3-642-15297-9_10MaRDI QIDQ3588087zbMATH OpenOpenAlexFDO

Authors Rüdiger Ehlers, Robert Mattmüller, Hans-Jörg Peter

Publication date 10 September 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-15297-9_10

Mathematics Subject Classification ID

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

Recommendations

• CONCUR 2005 – Concurrency Theory
• Timed Parity Games: Complexity and Robustness
• Automata-theoretic decision of timed games
• Reachability-Time Games on Timed Automata
• Timed Parity Games: Complexity and Robustness

Cited in

(2)

• Verification and performance evaluation of timed game strategies
• Symbolic computational techniques for solving games

Describes a project that uses

Uses Software

• UPPAAL TIGA
• Uppaal
• CUDD

This page was built for publication: Combining symbolic representations for solving timed games

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