Pages that link to "Item:Q3543286"
From MaRDI portal
The following pages link to Infinite Runs in Weighted Timed Automata with Energy Constraints (Q3543286):
Displaying 50 items.
- The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete (Q344560) (← links)
- Modal transition systems with weight intervals (Q444490) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (Q524362) (← links)
- Faster algorithms for mean-payoff games (Q537946) (← links)
- Quantitative analysis of weighted transition systems (Q710680) (← links)
- Extending finite-memory determinacy to multi-player games (Q1641036) (← links)
- Energy parity games (Q1758152) (← links)
- Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines (Q1785845) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- Optimal and robust controller synthesis using energy timed automata with uncertainty (Q1996422) (← links)
- Optimal and robust controller synthesis. Using energy timed automata with uncertainty (Q2024347) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Weighted automata (Q2074206) (← links)
- The GKK algorithm is the fastest over simple mean-payoff games (Q2097231) (← links)
- Zone-based verification of timed automata: extrapolations, simulations and what next? (Q2112098) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
- Strategy synthesis for multi-dimensional quantitative objectives (Q2249657) (← links)
- The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
- Reachability in two-clock timed automata is PSPACE-complete (Q2347796) (← links)
- Average-energy games (Q2413482) (← links)
- Model checking and synthesis for branching multi-weighted logics (Q2423760) (← links)
- A note on the approximation of mean-payoff games (Q2446598) (← links)
- Reachability games with relaxed energy constraints (Q2672231) (← links)
- Quantitative controller synthesis for consumption Markov decision processes (Q2680240) (← links)
- Optimal Bounds for Multiweighted and Parametrised Energy Games (Q2842640) (← links)
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems (Q2948229) (← links)
- Bounding Average-Energy Games (Q2988367) (← links)
- Energy Games in Multiweighted Automata (Q3105747) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- Infinite Runs in Weighted Timed Automata with Energy Constraints (Q3543286) (← links)
- Weighted versus Probabilistic Logics (Q3637211) (← links)
- Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata (Q3648829) (← links)
- (Q5002811) (← links)
- (Q5013874) (← links)
- (Q5014442) (← links)
- (Q5020520) (← links)
- (Q5020522) (← links)
- Optimally Resilient Strategies in Pushdown Safety Games (Q5089248) (← links)
- (Q5089289) (← links)
- (Q5089314) (← links)
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions (Q5090979) (← links)
- (Q5091276) (← links)
- (Q5111253) (← links)
- Solving Mean-Payoff Games via Quasi Dominions (Q5164175) (← links)
- Parametric Verification of Weighted Systems (Q5240155) (← links)
- (Q5377470) (← links)
- (Q5875382) (← links)
