This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially
delayed transitions. We show that IMCs are closed under parallel
composition and hiding, and show how IMCs can be compositionally
aggregated prior to analysis by e.g., bisimulation minimisation or aggressive abstraction based on simulation pre-congruences. We survey some recent analysis techniques for IMCs, i.e., explaining how measures such as reachability probabilities can be obtained. Finally, we demonstrate that IMCs are a natural (and simple) semantic model for stochastic process algebras and generalised stochastic Petri nets and can be used for engineering formalisms such as AADL and dynamic fault trees.
|Name||Lecture Notes in Computer Science|
|Conference||Symposium on Formal Methods for Components and Objects, FMCO 2009|
|Period||4/11/09 → 6/11/09|
|Other||4 - 6 November 2009|