Optimal reachability for weighted timed games

DOI10.1007/978-3-540-27836-8_13MaRDI QIDQ5466455zbMATH OpenOpenAlexFDO

Authors Mikhail Bernadsky, Parthasarathy Madhusudan, Rajeev Alur

Publication date 24 August 2005

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

Full work available at URL https://doi.org/10.1007/b99859, https://repository.upenn.edu/cis_papers/204

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Games of timing (91A55)

Recommendations

• On the optimal reachability problem of weighted timed automata
• Formal Modeling and Analysis of Timed Systems
• Optimal reachability in divergent weighted timed games
• Robust weighted timed automata and games
• Optimal paths in weighted timed automata

Cited in

(34)

• Timed network games
• On the optimal reachability problem of weighted timed automata
• Optimal infinite scheduling for multi-priced timed automata
• Expected reachability-time games
• Robust weighted timed automata and games
• Model-based verification, optimization, synthesis and performance evaluation of real-time systems
• Optimal reachability in divergent weighted timed games
• Model Checking Real-Time Systems
• Efficient On-the-Fly Algorithms for Partially Observable Timed Games
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Model checking logic WCTL with multi constrained modalities on one clock priced timed automata
• Optimal complexity bounds for positive LTL games
• Optimal paths in weighted timed automata
• SMT-based searching for k-quasi-optimal runs in weighted timed automata
• Symbolic optimal reachability in weighted timed automata
• Timed network games with clocks
• Optimal strategies in weighted limit games
• Symbolic Approximation of Weighted Timed Games
• One-clock priced timed games with negative weights
• On the Value Problem in Weighted Timed Games.
• A Kleene-Schützenberger Theorem for Weighted Timed Automata
• Optimal strategies in priced timed game automata
• Formal Modeling and Analysis of Timed Systems
• Optimal paths in weighted timed automata
• Optimal controller synthesis for timed systems
• A Kleene-Schützenberger theorem for weighted timed automata
• Weighted o-minimal hybrid systems
• Inaproximability in weighted timed games
• Playing stochastically in weighted timed games to emulate memory
• Decidability of one-clock weighted timed games with arbitrary weights
• Synthesis of robust optimal real-time systems
• Playing stochastically in weighted timed games to emulate memory
• The value problem for weighted timed games with two clocks is undecidable
• Improved undecidability results on weighted timed automata

This page was built for publication: Optimal reachability for weighted timed games

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