Symbolic verification and strategy synthesis for linearly-priced probabilistic timed automata
Probabilistic timed automata are a formalism for modelling systems whose dynamics includes probabilistic, nondeterministic and timed aspects including real-time systems. A variety of techniques have been proposed for the analysis of this formalism and successfully employed to analyse, for example, w...
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Conference item |
| Baskı/Yayın Bilgisi: |
Springer
2017
|