Concavely-priced probabilistic timed automata

Jurdziński, M., Kwiatkowska, M., Norman, G. and Trivedi, A. (2009) Concavely-priced probabilistic timed automata. In: CONCUR 2009 - Concurrency Theory: 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings. Series: Lecture notes in computer science (5710). Springer, pp. 415-430. ISBN 9783642040801 (doi: 10.1007/978-3-642-04081-8_28)

Full text not currently available from Enlighten.


Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-complete for automata with one clock. Previous work on expected price problems for probabilistic timed automata was restricted to expected reachability for linearly-priced automata and integer valued initial states. This work uses the boundary region graph introduced by Jurdziński and Trivedi to analyse properties of concavely-priced (non-probabilistic) timed automata.

Item Type:Book Sections
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Jurdziński, M., Kwiatkowska, M., Norman, G., and Trivedi, A.
Subjects:Q Science > QA Mathematics > QA76 Computer software
College/School:College of Science and Engineering > School of Computing Science

University Staff: Request a correction | Enlighten Editors: Update this record