Projects per year
Quantitative analysis of computer systems is often based on Markovian models. Among the formalisms that are used in practice, Markovian process algebras have found many applications, also thanks to their compositional nature that allows one to specify systems as interacting individual automata that carry out actions. Nevertheless, as with all state-based modelling techniques, Markovian process algebras suer from the well-known state space explosion problem. State aggregation, specifically lumping, is one of the possible methods for tackling this problem. In this paper we revisit the notion of Markovian bisimulation which has previously been shown to induce a lumpable relation in the underlying Markov process. Here we consider the coarser relation of contextual lumpability, and taking the specific example of strong equivalence in PEPA, we propose a slightly relaxed denition of Markovian bisimulation, named lumpable bisimilarity, and prove that this is a characterisation of the notion of contextual lumpability for PEPA components. Moreover, we show that lumpable bisimilarity induces the largest contextual lumping over the Markov process underlying any PEPA component. We provide an algorithm for lumpable bisimilarity and study both its time and space complexity.
|Title of host publication||Proceedings of ValueTools 2013|
|Number of pages||10|
|Publication status||Published - 9 Dec 2013|
|Event||ValueTools 2013 -- 7th International Conference on Performance Evaluation Methodologies and Tools - Lingotto, Torino, Andorra|
Duration: 10 Dec 2013 → 12 Dec 2013
|Conference||ValueTools 2013 -- 7th International Conference on Performance Evaluation Methodologies and Tools|
|Period||10/12/13 → 12/12/13|
- stochastic process algebra
FingerprintDive into the research topics of 'Contextual Lumpability'. Together they form a unique fingerprint.
- 1 Finished
QUANTICOL - A Quantitative Approach to Management and Design of Collective and Adaptive Behaviours (RTD)
1/04/13 → 31/03/17