scientific article; zbMATH DE number 7453074
From MaRDI portal
Publication:5020520
Nicolas Markey, Ritam Raha, Loïc Hélouët
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/1909.07653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Cites Work
- Unnamed Item
- Positional strategies for mean payoff games
- Borel determinacy
- The complexity of mean payoff games on graphs
- Reachability in succinct one-counter games
- Energy parity games
- Strategy synthesis for multi-dimensional quantitative objectives
- The complexity of multi-mean-payoff and multi-energy games
- Optimal Bounds for Multiweighted and Parametrised Energy Games
- Generalized Mean-payoff and Energy Games
- On The Complexity of Counter Reachability Games*
- Timed automata with observers under energy constraints
- Bounding Average-Energy Games
- Energy Games in Multiweighted Automata
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Energy and Mean-Payoff Games with Imperfect Information
- Model Checking Succinct and Parametric One-Counter Automata
- Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
- The Cost of Exactness in Quantitative Reachability
- Reachability in Two-Clock Timed Automata Is PSPACE-Complete
- Model Checking Probabilistic Timed Automata with One or Two Clocks
This page was built for publication:
