Symbolic Model Checking of Probabilistic Timed Automata Using Backwards Reachability

We consider probabilistic timed automata of [13], an extension of the timed automata model of [2] with discrete probability distributions. In contrast to timed automata, which model real-time systems purely in terms of nondeterminism, our model allows to express the likelihood of the system making certain transitions, and is thus appropriate for modelling fault-tolerance and probabilistic failures. We present a symbolic model checking algorithm for the existential fragment of the logic PTCTL of [13] based on backward reachability as in [12]. The logic allows us to specify properties such as “with probability 0.99 or greater, it is possible to correctly deliver a data packet within 5 time units”, or “with probability 0.87 or greater, the system never enters an error state”.

[1]  Richard S. Varga,et al.  Proof of Theorem 6 , 1983 .

[2]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[3]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[4]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[5]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[6]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[7]  Stavros Tripakis,et al.  Analysis of Timed Systems Based on Time-Abstracting Bisimulation , 1996, CAV.

[8]  Thomas A. Henzinger,et al.  From Quantity to Quality , 1997, HART.

[9]  Theo C. Ruys,et al.  The Bounded Retransmission Protocol Must Be on Time! , 1997, TACAS.

[10]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

[11]  Wang Yi,et al.  Formal Design and Analysis of a Gear Controller , 1998, TACAS.

[12]  Stavros Tripakis,et al.  L'analyse formelle des systèmes temporisés en pratique. (The Formal Analysis of Timed Systems in Practice) , 1998 .

[13]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[14]  Stavros Tripakis,et al.  Kronos: A Model-Checking Tool for Real-Time Systems , 1998, CAV.

[15]  Wang Yi,et al.  New Generation of UPPAAL , 1998 .

[16]  Luca de Alfaro,et al.  Computing Minimum and Maximum Reachability Times in Probabilistic Systems , 1999, CONCUR.

[17]  R. Segala,et al.  Automatic Verification of Real-Time Systems with Discrete Probability Distributions , 1999, ARTS.