Pages that link to "Item:Q2908881"
From MaRDI portal
The following pages link to Generalized Mean-payoff and Energy Games (Q2908881):
Displaying 36 items.
- The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete (Q344560) (← links)
- Interface simulation distances (Q477211) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- Compositional strategy synthesis for stochastic games with multiple objectives (Q1641028) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- A delayed promotion policy for parity games (Q1784960) (← links)
- Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines (Q1785845) (← links)
- Quantitative reductions and vertex-ranked infinite games (Q2029603) (← links)
- Improving parity games in practice (Q2043434) (← links)
- Strategy synthesis for multi-dimensional quantitative objectives (Q2249657) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- Reachability games with relaxed energy constraints (Q2672231) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- Optimal Bounds for Multiweighted and Parametrised Energy Games (Q2842640) (← links)
- Temporal Specifications with Accumulative Values (Q2946736) (← links)
- Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems (Q2948229) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- Energy Games in Multiweighted Automata (Q3105747) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- (Q3384167) (← links)
- (Q3384874) (← links)
- (Q3384876) (← links)
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time (Q3449481) (← links)
- (Q5015267) (← links)
- (Q5020520) (← links)
- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems (Q5049036) (← links)
- Synthesis for Multi-weighted Games with Branching-Time Winning Conditions (Q5100749) (← links)
- Efficient Analysis of Probabilistic Programs with an Unbounded Counter (Q5501946) (← links)
- (Q5875382) (← links)
- (Q5875383) (← links)
- Percentile queries in multi-dimensional Markov decision processes (Q5892424) (← links)
- Submixing and shift-invariant stochastic games (Q6183353) (← links)
- Multi-weighted reachability games (Q6623017) (← links)