15 search results - page 1 / 3 » Quantitative Games on Probabilistic Timed Automata |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
CONCUR
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
FORMATS
2004
Springer
13 years 10 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...