Expected reachability-time games
From MaRDI portal
Publication:278757
DOI10.1016/j.tcs.2016.04.021zbMath1339.68146arXiv1604.04435OpenAlexW2570061587MaRDI QIDQ278757
Ashutosh Trivedi, Marta Kwiatkowska, Gethin Norman, Vojtěch Forejt
Publication date: 2 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.04435
Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (2)
Verification and control for probabilistic hybrid automata with finite bisimulations ⋮ Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Checking timed Büchi automata emptiness efficiently
- Improved undecidability results on weighted timed automata
- State explosion in almost-sure probabilistic reachability
- The complexity of stochastic games
- A theory of timed automata
- The complexity of mean payoff games on graphs
- Automatic verification of real-time systems with discrete probability distributions.
- On probabilistic timed automata.
- Quantitative solution of omega-regular games
- Model checking for probabilistic timed automata
- Symbolic model checking for probabilistic timed automata
- Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata
- Verification of Open Interactive Markov Chains
- Concavely-Priced Probabilistic Timed Automata
- Probabilistic Robust Timed Games
- Value Iteration
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- Stochastic Real-Time Games with Qualitative Timed Automata Objectives
- Expected Reachability-Time Games
- Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study
- Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
- Reachability in Stochastic Timed Games
- What good are digital clocks?
- Hybrid Systems: Computation and Control
- Minimum-Time Reachability in Timed Games
- Reachability-Time Games on Timed Automata
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Automata, Languages and Programming
- Formal Modeling and Analysis of Timed Systems
This page was built for publication: Expected reachability-time games