scientific article; zbMATH DE number 7649916

DOI10.4230/LIPIcs.CONCUR.2019.8MaRDI QIDQ5875369

Youssouf Oualhadj, Florent Delgrange, Thomas Brihaye, Mickael Randour

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov decision processeswindow mean-payoffwindow parity

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Storm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Trading performance for stability in Markov decision processes
• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
• The complexity of membership problems for circuits over sets of integers
• Number of quantifiers is better than number of tape cells
• Looking at mean payoff through foggy windows
• Reasoning about cost-utility constraints in probabilistic models
• Automata, logics, and infinite games. A guide to current research
• Value iteration for long-run average reward in Markov decision processes
• Multi-cost bounded reachability in MDP
• Looking at mean-payoff and total-payoff through windows
• Reachability in two-clock timed automata is PSPACE-complete
• Finitary winning in ω-regular games
• Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
• The Odds of Staying on Budget
• Games through Nested Fixpoints
• On the menbership problem for functional and multivalued dependencies in relational databases
• Stability in Graphs and Games
• On the complexity of heterogeneous multidimensional quantitative games
• Weight monitoring with linear temporal logic
• Deciding parity games in quasipolynomial time
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
• Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
• A pseudo-quasi-polynomial algorithm for mean-payoff parity games
• Variations on the Stochastic Shortest Path Problem
• Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
• Decisive Markov Chains
• Percentile queries in multi-dimensional Markov decision processes

This page was built for publication: