Conference item icon

Conference item

Symbolic verification and strategy synthesis for linearly-priced probabilistic timed automata

Abstract:

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, wireless communication protocols and computer security systems. Augmenting the model with prices (or, equivalently, costs or rewards) provides a means to verify more complex quantitative properties,...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-319-63121-9_15

Authors


More by this author
Department:
Trinity College
Publisher:
Springer Publisher's website
Publication date:
2017-08-05
Acceptance date:
2017-05-05
DOI:
Pubs id:
pubs:693880
URN:
uri:0f34294b-e292-405f-9bc0-8df65fa88862
UUID:
uuid:0f34294b-e292-405f-9bc0-8df65fa88862
Local pid:
pubs:693880

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP