Expected reachability-time games

Forejt, V., Kwiatkowska, M., Norman, G. and Trivedi, A. (2010) Expected reachability-time games. Lecture Notes in Computer Science, 6246, pp. 122-136. (doi: 10.1007/978-3-642-15297-9_11)

Full text not currently available from Enlighten.


In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respectively, the expected time to reach a target. These games are concurrent since at each step of the game both players choose a timed move (a time delay and action under their control), and the transition of the game is determined by the timed move of the player who proposes the shorter delay. A game is turn-based if at any step of the game, all available actions are under the control of precisely one player. We show that while concurrent ERTGs are not always determined, turn-based ERTGs are positionally determined. Using the boundary region graph abstraction, and a generalisation of Asarin and Maler’s simple function, we show that the decision problems related to computing the upper/lower values of concurrent ERTGs, and computing the value of turn-based ERTGs are decidable and their complexity is in NEXPTIME ∩ co-NEXPTIME.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Forejt, V., Kwiatkowska, M., Norman, G., and Trivedi, A.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
ISSN (Online):1611-3349

University Staff: Request a correction | Enlighten Editors: Update this record