Probabilistic Duration Calculus for Continuous Time

This paper deals with dependability of imperfect implementations concerning given requirements. The requirements are assumed to be written as formulas in Duration Calculus. Implementations are modelled by continuous semi-Markov processes with finite state space, which are expressed in the paper as finite automata with stochastic delays of state transitions. A probabilistic model for Duration Calculus formulas is introduced, so that the satisfaction probabilities of Duration Calculus formulas with respect to semi-Markov processes can be defined, reasoned about and calculated through a set of axioms and rules of the model.

[1]  Anders P. Ravn,et al.  Towards a calculus of systems dependability , 1992 .

[2]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[3]  Michael R. Hansen,et al.  Semantics and Completeness of Duration Calculus , 1991, REX Workshop.

[4]  Jim Davies,et al.  Timed CSP: Theory and Practice , 1991, REX Workshop.

[5]  H. D. Miller,et al.  The Theory Of Stochastic Processes , 1977, The Mathematical Gazette.

[6]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[7]  Jens Nordahl,et al.  From CSP Models to Markov Models , 1993, IEEE Trans. Software Eng..

[8]  Ward Whitt,et al.  Continuity of Generalized Semi-Markov Processes , 1980, Math. Oper. Res..

[9]  Thomas A. Henzinger,et al.  Timed Transition Systems , 1991, REX Workshop.

[10]  J. Griffiths.  The Theory of Stochastic Processes , 1967 .

[11]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[12]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

[13]  A. Ravn,et al.  A Probabilistic Duration Calculus , 1992 .