Model-checking continuous-time Markov chains

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.

[1]  Thomas Kailath,et al.  Linear Systems , 1980 .

[2]  Ivan Niven.  Irrational Numbers: THE GENERALIZED LINDEMANN THEOREM , 1956 .

[3]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  Angus Macintyre,et al.  On the decidability of the real exponential field , 1996 .

[5]  Rajeev Alur,et al.  Model-Checking for Probabilistic Real-Time Systems (Extended Abstract) , 1991, ICALP.

[6]  Christel Baier,et al.  Approximate Symbolic Model Checking of Continuous-Time Markov Chains , 1999, CONCUR.

[7]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[8]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[9]  S. Liberty,et al.  Linear Systems , 2010, Scientific Parallel Computing.

[10]  Mihalis Yannakakis,et al.  Verifying temporal properties of finite-state probabilistic programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[11]  Daniel Richardson,et al.  How to Recognize Zero , 1997, J. Symb. Comput..