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.
No takes yet. Share an insight, caveat, or question.
Aziz et al. (2000) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: