Infinite Runs in Weighted Timed Automata with Energy Constraints

DOI10.1007/978-3-540-85778-5_4zbMath1171.68524OpenAlexW1569998753MaRDI QIDQ3543286

Uli Fahrenberg, Nicolas Markey, Patricia Bouyer, Kim Guldstrand Larsen, Jiří Srba

Publication date: 2 December 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-85778-5_4

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35)

Related Items (56)

Graph Games and Reactive Synthesis ⋮ Model Checking Real-Time Systems ⋮ Extending finite-memory determinacy to multi-player games ⋮ The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete ⋮ Average-energy games ⋮ Reachability games with relaxed energy constraints ⋮ Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems ⋮ Quantitative controller synthesis for consumption Markov decision processes ⋮ Model checking and synthesis for branching multi-weighted logics ⋮ Reasoning about Quality and Fuzziness of Strategic Behaviors ⋮ Playing Safe, Ten Years Later ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Energy Büchi problems ⋮ Solving mean-payoff games via quasi dominions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Modal transition systems with weight intervals ⋮ Computing branching distances with quantitative games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Alternation-free weighted mu-calculus: decidability and completeness ⋮ Parametric Verification of Weighted Systems ⋮ A note on the approximation of mean-payoff games ⋮ Bounding Average-Energy Games ⋮ Infinite Runs in Weighted Timed Automata with Energy Constraints ⋮ Polynomial-time algorithms for energy games with special weight structures ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Optimal and robust controller synthesis using energy timed automata with uncertainty ⋮ Solving Mean-Payoff Games via Quasi Dominions ⋮ Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games ⋮ Energy parity games ⋮ Faster algorithms for mean-payoff games ⋮ Quantitative analysis of weighted transition systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal and robust controller synthesis. Using energy timed automata with uncertainty ⋮ Unnamed Item ⋮ Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines ⋮ Weighted register automata and weighted logic on data words ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ Weighted versus Probabilistic Logics ⋮ Optimally Resilient Strategies in Pushdown Safety Games ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions ⋮ Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata ⋮ Energy Games in Multiweighted Automata ⋮ Weighted automata ⋮ Optimal Bounds for Multiweighted and Parametrised Energy Games ⋮ The GKK algorithm is the fastest over simple mean-payoff games ⋮ The complexity of multi-mean-payoff and multi-energy games ⋮ Reachability in two-clock timed automata is PSPACE-complete ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Improved undecidability results on weighted timed automata
• Positional strategies for mean payoff games
• Borel determinacy
• On the optimal reachability problem of weighted timed automata
• Costs Are Expensive!
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Alternation
• Discount-Optimal Infinite Runs in Priced Timed Automata
• Hybrid Systems: Computation and Control
• CONCUR 2004 - Concurrency Theory
• Almost Optimal Strategies in One Clock Priced Timed Games
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automata, Languages and Programming
• Foundations of Software Science and Computational Structures
• Model-Checking One-Clock Priced Timed Automata
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Infinite Runs in Weighted Timed Automata with Energy Constraints