%0 Conference Proceedings
%T Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities
%+ Università degli studi di Torino = University of Turin (UNITO)
%A Sproston, Jeremy
%Z Part 1: Full Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 40th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE)
%C Valletta, Malta
%Y Alexey Gotsman
%Y Ana Sokolova
%I Springer International Publishing
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-12136
%P 150-168
%8 2020-06-15
%D 2020
%R 10.1007/978-3-030-50086-3_9
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-03283239/document
%2 https://inria.hal.science/hal-03283239/file/495615_1_En_9_Chapter.pdf
%L hal-03283239
%U https://inria.hal.science/hal-03283239
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-12136