Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Model-checking continuous-time Markov chains

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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Model-checking continuous-time Markov chains

Download PDF
9 pages

Loading next page...
 
/lp/association-for-computing-machinery/model-checking-continuous-time-markov-chains-FbtHbZEvbA

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2000 by ACM Inc.
ISSN
1529-3785
DOI
10.1145/343369.343402
Publisher site
See Article on Publisher Site

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.

Journal

ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery

Published: Jul 1, 2000

There are no references for this article.