Abstract.
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received November 1994 / Accepted in revised form June 1998
Rights and permissions
About this article
Cite this article
Van Hung, D., Chaochen, Z. Probabilistic Duration Calculus for Continuous Time. Formal Aspects of Computing 11, 21–44 (1999). https://doi.org/10.1007/s001650050034
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001650050034