A Probabilistic Duration Calculus

  • Authors:
  • Zhiming Liu;Anders P. Ravn;Erlin V. Sorensen;Chaochen Zhou

  • Affiliations:
  • -;-;-;-

  • Venue:
  • A Probabilistic Duration Calculus
  • Year:
  • 1992

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a calculus that enables a designer of an embedded, real-time system to reason about and calculate whether a given requirement will hold with a sufficient high probability for given failure probabilities for components used in the design of the system. The main idea is to specify requirements and design in Duration Calculus, a real-time, interval logic, to define satisfaction probabilities for formulas in this calculus, and establish a calculus with rules that support calculation of the probability for a composite formula from probabilities of its constituents. This ensures that reasoning about probabilities is consistent with requirements and design decisions. We thus avoid introducing separate models for requirements and reliability analysis. The system model is a finite automaton with fixed transition probabilities. This defines discrete Markov processes as basis for the calulus. Keywords: duration calculus, real-time systems, probabilistic automata, satisfaction probability.