Skip to Main content Skip to Navigation
New interface
Conference papers

Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities

Abstract : Clock-dependent probabilistic timed automata extend classical timed automata with discrete probabilistic choice, where the probabilities are allowed to depend on the exact values of the clocks. Previous work has shown that the quantitative reachability problem for clock-dependent probabilistic timed automata with at least three clocks is undecidable. In this paper, we consider the subclass of clock-dependent probabilistic timed automata that have one clock, that have clock dependencies described by affine functions, and that satisfy an initialisation condition requiring that, at some point between taking edges with non-trivial clock dependencies, the clock must have an integer value. We present an approach for solving in polynomial time quantitative and qualitative reachability problems of such one-clock initialised clock-dependent probabilistic timed automata. Our results are obtained by a transformation to interval Markov decision processes.
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, July 9, 2021 - 5:53:57 PM
Last modification on : Monday, February 7, 2022 - 4:06:04 PM
Long-term archiving on: : Sunday, October 10, 2021 - 8:29:18 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2023-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Jeremy Sproston. Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities. 40th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2020, Valletta, Malta. pp.150-168, ⟨10.1007/978-3-030-50086-3_9⟩. ⟨hal-03283239⟩



Record views