Two-player reachability-price games on single-clock timed automata

MaRDI QIDQ4965809zbMATH OpenFDO

Authors Michał Rutkowski

Publication date 10 March 2021

Full work available at URL https://arxiv.org/abs/1107.1199, http://eptcs.web.cse.unsw.edu.au/paper.cgi?QAPL2011.3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05)

Recommendations

• Reachability-Time Games on Timed Automata
• Formal Modeling and Analysis of Timed Systems
• Simple priced timed games are not that simple
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Minimum-Time Reachability in Timed Games

Cited in

(16)

• A faster algorithm for solving one-clock priced timed games
• Symbolic Approximation of Weighted Timed Games
• scientific article; zbMATH DE number 7577581 (Why is no real title available?)
• Adding negative prices to priced timed games
• Simple priced timed games are not that simple
• Decidability of one-clock weighted timed games with arbitrary weights
• Minimum-Time Reachability in Timed Games
• Reachability-Time Games on Timed Automata
• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond
• Timed automata with observers under energy constraints
• Average-time games
• Model Checking Real-Time Systems
• Inaproximability in weighted timed games
• Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
• Optimal controller synthesis for timed systems
• Expected reachability-price games

This page was built for publication: Two-player reachability-price games on single-clock timed automata

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