Three-valued abstraction for continuous-time markov chains

64Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes a novel abstraction technique for continuous-time Markov chains (CTMCs). Our technique fits within the realm of three-valued abstraction methods that have been used successfully for traditional model checking. The key idea is to apply abstraction on uniform CTMCs that are readily obtained from general CTMCs, and to abstract transition probabilities by intervals. It is shown that this provides a conservative abstraction for both true and false for a three-valued semantics of the branching-time logic CSL (Continuous Stochastic Logic). Experiments on an infinite-state CTMC indicate the feasibility of our abstraction technique. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Katoen, J. P., Klink, D., Leucker, M., & Wolf, V. (2007). Three-valued abstraction for continuous-time markov chains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4590 LNCS, pp. 311–324). Springer Verlag. https://doi.org/10.1007/978-3-540-73368-3_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free