Model-checking continuous-time Markov chains

  • Authors:
  • Adnan Aziz;Kumud Sanwal;Vigyan Singhal;Robert Brayton

  • Affiliations:
  • Univ. of Texas at Austin, Austin;Lucent Technologies;Tempus-Fugit, Inc.;Univ. of California at Berkeley, Berkeley

  • Venue:
  • ACM Transactions on Computational Logic (TOCL)
  • Year:
  • 2000

Quantified Score

Hi-index 0.02

Visualization

Abstract

We present a logical formalism for expressing properties of continuous-time Markov chains. The semantics for such properties arise as a natural extension of previous work on discrete-time Markov chains to continuous time. The major result is that the verification problem is decidable; this is shown using results in algebraic and transcendental number theory.