231 search results - page 4 / 47 » Concurrent Reachability Games |
FORMATS
2009
Springer
13 years 11 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...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
CSR
2010
Springer
14 years 8 days ago
2010
Springer
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
CONCURRENCY
2011
13 years 2 months ago
2011