Verifying Soft Deadlines with Probabilistic Timed Automata

This paper describes work in progess performed as part of an ongoing project aimed at the development of theoretical foundations and model checking algorithms for the verification of soft deadlines in timed systems, that is, properties such as "there is a 90% chance that the message will be delivered within 5 time units". The research is focussed on the probabilistic timed automata model (11), an extension of timed automata (3), and includes: model checking of discrete-probabilistic au- tomata based on the region graph construction (11); symbolic methods based on forwards and backwards reachability (10,13); and the continuous probabilistic timed automata (12).

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

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

[3]  Marta Kwiatkowska,et al.  Symbolic Model Checking of Probabilistic Timed Automata Using Backwards Reachability , 2000 .

[4]  Marta Z. Kwiatkowska,et al.  Verifying Quantitative Properties of Continuous Probabilistic Timed Automata , 2000, CONCUR.

[5]  Gordon S. Blair,et al.  A formal approach to the design of QoS parameters in multimedia systems. , 1996 .

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

[7]  Giorgio C. Buttazzo,et al.  QoS guarantee using probabilistic deadlines , 1999, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99.

[8]  Marta Z. Kwiatkowska,et al.  Automatic verification of real-time systems with discrete probability distributions , 1999, Theor. Comput. Sci..

[9]  Diego Latella,et al.  Automatic Verification of a Lip-Synchronisation Protocol Using Uppaal , 1998, Formal Aspects of Computing.

[10]  Thomas Stauner,et al.  Using HYTECH to Verify an Automative Control System , 1997, HART.

[11]  Joost-Pieter Katoen,et al.  Specification and analysis of soft real-time systems: quantity and quality , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

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

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