Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata

Kwiatkowska, M., Norman, G. and Parker, D. (2017) Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata. In: KiMfest: A Conference in Honour of Kim G. Larsen on the Occasion of his 60th Birthday, Aalborg University, Denmark, 19-20 Aug 2017, pp. 289-309. ISBN 9783319631202 (doi: 10.1007/978-3-319-63121-9_15)

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, such as the expected energy usage of a device or the expected number of messages sent during a protocol’s execution. However, the analysis of these properties on probabilistic timed automata currently relies on a technique based on integer discretisation of real-valued clocks, which can be expensive in some cases. In this paper, we propose symbolic techniques for verification and optimal strategy synthesis for priced probabilistic timed automata which avoid this discretisation. We build upon recent work for the special case of expected time properties, using value iteration over a zone-based abstraction of the model.

• Item Type: Conference Proceedings
• Additional Information: Published in Lecture Notes in Computer Science, v. 10460, pp. 289-309
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Norman, Dr Gethin
• Authors: Kwiatkowska, M., Norman, G., and Parker, D.
• College/School: College of Science and Engineering > School of Computing Science
• ISBN: 9783319631202
• Published Online: 25 July 2017
• Copyright Holders: Copyright © 2017 Springer International Publishing AG
• First Published: First published in Lecture Notes in Computer Science 101460:289-309
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher

Related URLs

• Organisation