Improving Time Bounded Reachability Computations in Interactive Markov Chains - Fundamentals of Software Engineering Access content directly
Conference Papers Year : 2013

Improving Time Bounded Reachability Computations in Interactive Markov Chains

Abstract

Interactive Markov Chains ($\text {IMCs}$) are compositional behaviour models extending both Continuous Time Markov Chain (CTMC) and Labeled Transition System (LTS). They are used as semantic models in different engineering contexts ranging from ultramodern satellite designs to industrial system-on-chip manufacturing. Different approximation algorithms have been proposed for model checking of $\text {IMC}$, with time bounded reachability probabilities playing a pivotal role. This paper addresses the accuracy and efficiency of approximating time bounded reachability probabilities in $\text {IMC}$, improving over the state-of-the-art in both efficiency of computation and tightness of approximation. Experimental evidence is provided by applying the new method on a case study.
Fichier principal
Vignette du fichier
978-3-642-40213-5_16_Chapter.pdf (404.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01514669 , version 1 (26-04-2017)

Licence

Attribution

Identifiers

Cite

Hassan Hatefi, Holger Hermanns. Improving Time Bounded Reachability Computations in Interactive Markov Chains. 5th International Conference on Fundamentals of Software Engineering (FSEN), Apr 2013, Tehran, Iran. pp.250-266, ⟨10.1007/978-3-642-40213-5_16⟩. ⟨hal-01514669⟩
107 View
172 Download

Altmetric

Share

Gmail Facebook X LinkedIn More