Expected reachability-time games

Forejt, V., Kwiatkowska, M., Norman, G. and Trivedi, A. (2016) Expected reachability-time games. Theoretical Computer Science, 631, pp. 139-160. (doi: 10.1016/j.tcs.2016.04.021)

118492.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.



Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such automata where the objective of the game is specified as the expected time to reach a target. The two players—called player Min and player Max—compete by proposing timed moves simultaneously and the move with a shorter delay is performed. The first player attempts to minimise the given objective while the second tries to maximise the objective. We observe that these games are not determined, and study decision problems related to computing the upper and lower values, showing that the problems are decidable and lie in the complexity class NEXPTIME ∩ co-NEXPTIME.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Forejt, V., Kwiatkowska, M., Norman, G., and Trivedi, A.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Theoretical Computer Science
ISSN (Online):1879-2294
Published Online:20 April 2016
Copyright Holders:Copyright © 2016 Elsevier
First Published:First published in Theoretical Computer Science 631:139-160
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

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