Model-checking continuous-time Markov chains
Top Cited Papers
- 1 July 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 1 (1) , 162-170
- https://doi.org/10.1145/343369.343402
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.Keywords
This publication has 3 references indexed in Scilit:
- How to Recognize ZeroJournal of Symbolic Computation, 1997
- A logic for reasoning about time and reliabilityFormal Aspects of Computing, 1994
- Irrational NumbersPublished by American Mathematical Society (AMS) ,1956