Theoretical Computer Science
Finitely additive stochastic games with Borel measurable payoffs
International Journal of Game Theory
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Verifying Automata Specifications of Probabilistic Real-time Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Dynamic Programming and Optimal Control, Vol. II
Dynamic Programming and Optimal Control, Vol. II
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Delayed Nondeterminism in Continuous-Time Markov Decision Processes
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Reachability in Stochastic Timed Games
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Measuring performance of continuous-time stochastic processes using timed automata
Proceedings of the 14th international conference on Hybrid systems: computation and control
Efficient CTMC model checking of linear real-time objectives
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Observing continuous-time MDPs by 1-clock timed automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Playing optimally on timed automata with random delays
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
We consider two-player stochastic games over real-time probabilistic processes where the winning objective is specified by a timed automaton. The goal of player □ is to play in such a way that the play (a timed word) is accepted by the timed automaton with probability one. Player ⋄ aims at the opposite. We prove that whenever player □ has a winning strategy, then she also has a strategy that can be specified by a timed automaton. The strategy automaton reads the history of a play, and the decisions taken by the strategy depend only on the region of the resulting configuration. We also give an exponential-time algorithm which computes a winning timed automaton strategy if it exists.