31 search results - page 1 / 7 » Minimum-Time Reachability in Timed Games |
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
FORMATS
2010
Springer
13 years 3 months ago
2010
Springer
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, respec...
SOFSEM
2009
Springer
14 years 2 months ago
2009
Springer
Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundam...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
FORMATS
2009
Springer
13 years 9 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...