Name
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. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1145/343369.343402 | ACM Trans. Comput. Log. |
Keywords | Field | DocType |
transcendental number theory,verification problem,logical formalism,continuous-time markov chain,previous work,natural extension,real time,discrete-time markov chain,formal verification,major result,model checking,additional key words and phrases: formal veriflcation,transcen- dental number theory,continuous time,verification,continuous time markov chain,systems of equations,markov chains,number theory | Discrete mathematics,Combinatorics,Markov chain mixing time,Markov process,Markov property,Markov model,Markov chain,Balance equation,Markov kernel,Mathematics,Examples of Markov chains | Journal |
Volume | Issue | Citations |
1 | 1 | 248 |
PageRank | References | Authors |
10.09 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adnan Aziz | 1 | 1778 | 149.76 |
| Kumud Sanwal | 2 | 421 | 20.49 |
| Vigyan Singhal | 3 | 961 | 86.42 |
| Robert K. Brayton | 4 | 6224 | 883.32 |