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

zbMATH Open1457.68149arXiv1107.1199MaRDI QIDQ4965809FDOQ4965809

Authors: Michał Rutkowski 

Publication date: 10 March 2021

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

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

Mathematics Subject Classification ID

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

Cited In (13)

• A faster algorithm for solving one-clock priced timed games
• Symbolic Approximation of Weighted Timed Games
• Title not available (Why is that?)
• Adding negative prices to priced timed games
• Simple priced timed games are not that simple
• Minimum-Time Reachability in Timed Games
• Reachability-Time Games on Timed Automata
• Timed automata with observers under energy constraints
• Average-time games
• Model Checking Real-Time Systems
• Optimal controller synthesis for timed systems
• Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
• 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)