Infinite Runs in Weighted Timed Automata with Energy Constraints
From MaRDI portal
Publication:3543286
DOI10.1007/978-3-540-85778-5_4zbMATH Open1171.68524OpenAlexW1569998753MaRDI QIDQ3543286FDOQ3543286
Authors: Patricia Bouyer, Uli Fahrenberg, Nicolas Markey, Kim G. 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
Recommendations
- Discount-optimal infinite runs in priced timed automata
- Timed automata with observers under energy constraints
- On the optimal reachability problem of weighted timed automata
- Improved undecidability results on weighted timed automata
- On the Interval-Bound Problem for Weighted Timed Automata
- A Kleene-Schützenberger theorem for weighted timed automata
- A Kleene-Schützenberger Theorem for Weighted Timed Automata
- scientific article; zbMATH DE number 1794360
- Optimal paths in weighted timed automata
- On MITL and alternating timed automata over infinite words
Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80)
Cites Work
- Title not available (Why is that?)
- Borel determinacy
- Alternation
- Hybrid Systems: Computation and Control
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Automata, Languages and Programming
- Formal Modeling and Analysis of Timed Systems
- Improved undecidability results on weighted timed automata
- Positional strategies for mean payoff games
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- On the optimal reachability problem of weighted timed automata
- Costs Are Expensive!
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Model-Checking One-Clock Priced Timed Automata
- Discount-optimal infinite runs in priced timed automata
- Foundations of Software Science and Computational Structures
- CONCUR 2004 - Concurrency Theory
- Almost Optimal Strategies in One Clock Priced Timed Games
- Model Checking Probabilistic Timed Automata with One or Two Clocks
Cited In (58)
- Characterizing positionality in games of Infinite duration over infinite graphs
- Playing Safe, Ten Years Later
- Half-positional objectives recognized by deterministic Büchi automata
- Energy Büchi problems
- Solving mean-payoff games via quasi dominions
- Characterizing positionality in games of infinite duration over infinite graphs
- Efficient Algorithms for Omega-Regular Energy Games
- Model-based verification, optimization, synthesis and performance evaluation of real-time systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Revisiting decidability and optimum reachability for multi-priced timed automata
- Modal transition systems with weight intervals
- Weighted versus Probabilistic Logics
- Alternation-free weighted mu-calculus: decidability and completeness
- An $\omega$-algebra for real-time energy problems
- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Quantitative analysis of weighted transition systems
- Average-energy games
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
- Quantitative controller synthesis for consumption Markov decision processes
- Energy parity games
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Energy games in multiweighted automata
- Timed automata with observers under energy constraints
- Extending finite-memory determinacy to multi-player games
- The complexity of multi-mean-payoff and multi-energy games
- Reachability in two-clock timed automata is PSPACE-complete
- Bounding Average-Energy Games
- Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines
- Average-energy games
- Computing branching distances with quantitative games
- Weighted register automata and weighted logic on data words
- Faster algorithms for mean-payoff parity games
- Graph Games and Reactive Synthesis
- Model Checking Real-Time Systems
- Optimally Resilient Strategies in Pushdown Safety Games
- Faster algorithms for mean-payoff games
- Parametric Verification of Weighted Systems
- The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete
- Reachability games with relaxed energy constraints
- Reachability games with relaxed energy constraints
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- Faster algorithms for quantitative verification in bounded treewidth graphs
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Optimal bounds for multiweighted and parametrised energy games
- Costs and rewards in priced timed automata
- Weighted automata
- A note on the approximation of mean-payoff games
- Solving mean-payoff games via quasi dominions
- \(^*\)-continuous Kleene \(\omega\)-algebras for energy problems
- Title not available (Why is that?)
- Optimal and robust controller synthesis using energy timed automata with uncertainty
- Optimal and robust controller synthesis. Using energy timed automata with uncertainty
- Model checking and synthesis for branching multi-weighted logics
- Energy mean-payoff games
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
- A faster deterministic exponential time algorithm for energy games and mean payoff games
- The GKK algorithm is the fastest over simple mean-payoff games
This page was built for publication: Infinite Runs in Weighted Timed Automata with Energy Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543286)
