| | |
Summary: Model Checking Continuous Time Markov Chains
Adnan Aziz
The University of Texas at Austin
and
Kumud Sanwal
Lucent Technologies
and
Vigyan Singhal
Tempus-Fugit, Inc.
and
Robert Brayton
The University of California at Berkeley
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.
Categories and Subject Descriptors: D.2.4 [Software/Program Verification]: Model checking;
F.3.1 [Specifying and Verifying and Reasoning about Programs]: Logics of Programs;
C.2.2 [Network Protocols]: Protocol verification; G.1.5 [Roots of Nonlinear Equations]:
Systems of equations; G.3 [Probability and Statistics]: Stochastic processes
|
