Probabilistic Timed Automata with Clock-Dependent Probabilities

2017/07/14 by Sproston, Jeremy
#FOS: Computer and information sciences #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.1707.04507

Abstract

Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities can depend linearly on clock values. Clock-dependent probabilistic timed automata allow the modelling of a continuous relationship between time passage and the likelihood of system events. We show that the problem of deciding whether the maximum probability of reaching a certain location is above a threshold is undecidable for clock-dependent probabilistic timed automata. On the other hand, we show that the maximum and minimum probability of reaching a certain location in clock-dependent probabilistic timed automata can be approximated using a region-graph-based approach.

Related

• Unknown Biases and Timing Constraints in Timed Automata
• Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
• An Extension of the Inverse Method to Probabilistic Timed Automata
• Reachability and Reward Checking for Stochastic Timed Automata
• Reachability and Reward Checking for Stochastic Timed Automata