Detailed Information on Publication Record
2016
Expected Reachability-Time Games
FOREJT, Vojtěch, Marta KWIATKOWSKA, Gethin NORMAN and Ashutosh TRIVEDIBasic information
Original name
Expected Reachability-Time Games
Authors
FOREJT, Vojtěch (203 Czech Republic, guarantor, belonging to the institution), Marta KWIATKOWSKA (826 United Kingdom of Great Britain and Northern Ireland), Gethin NORMAN (826 United Kingdom of Great Britain and Northern Ireland) and Ashutosh TRIVEDI (356 India)
Edition
Theoretical Computer Science, North Holland, 2016, 0304-3975
Other information
Language
English
Type of outcome
Článek v odborném periodiku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Netherlands
Confidentiality degree
není předmětem státního či obchodního tajemství
Impact factor
Impact factor: 0.698
RIV identification code
RIV/00216224:14330/16:00094153
Organization unit
Faculty of Informatics
UT WoS
000377839900007
Keywords in English
stochastic systems; timed automata; games
Změněno: 27/4/2017 07:17, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
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 intersection co-NEXPTIME.
Links
| MUNI/33/IP1/2016, interní kód MU |
|