Infinite Runs in Weighted Timed Automata with Energy Constraints

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

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

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

91A80: Applications of game theory

68Q45: Formal languages and automata

90B35: Deterministic scheduling theory in operations research

Related Items

Alternation-free weighted mu-calculus: decidability and completeness, The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete, Modal transition systems with weight intervals, Polynomial-time algorithms for energy games with special weight structures, Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games, Faster algorithms for mean-payoff games, Quantitative analysis of weighted transition systems, Extending finite-memory determinacy to multi-player games, Energy parity games, Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines, Weighted register automata and weighted logic on data words, Strategy synthesis for multi-dimensional quantitative objectives, The complexity of multi-mean-payoff and multi-energy games, Reachability in two-clock timed automata is PSPACE-complete, Average-energy games, A note on the approximation of mean-payoff games, Optimal Bounds for Multiweighted and Parametrised Energy Games, Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems, Bounding Average-Energy Games, Energy Games in Multiweighted Automata, Graph Games and Reactive Synthesis, Model Checking Real-Time Systems, Infinite Runs in Weighted Timed Automata with Energy Constraints, Weighted versus Probabilistic Logics, Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata

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