Lumping matrix diagram representations of markov models

Salem Derisavi, Peter Kemper, William H. Sanders

Research output: Contribution to conferencePaper

Abstract

Continuous-time Markov chains (CTMCs) have been used successfully to model the dependability and performability of many systems. Matrix diagrams (MDs) are known to be a space-efficient, symbolic representation of large CTMCs. In this paper, we identify local conditions for exact and ordinary lumpings that allow us to lump MD representations of Markov models in a compositional manner. We propose a lumping algorithm for CTMCs that are represented as MDs that is based on partition refinement, is applied to each level of an MD directly, and results in an MD representation of the lumped CTMC. Our compositional lumping approach is complementary to other known model-level lumping approaches for matrix diagrams. The approach has been implemented, and we demonstrate its efficiency and benefits by evaluating an example model of a tandem multi-processor system with load balancing and failure and repair operations.

Original languageEnglish (US)
Pages742-751
Number of pages10
DOIs
StatePublished - Nov 9 2005
Event2005 International Conference on Dependable Systems and Networks - Yokohama, Japan
Duration: Jun 28 2005Jul 1 2005

Other

Other2005 International Conference on Dependable Systems and Networks
CountryJapan
CityYokohama
Period6/28/057/1/05

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Lumping matrix diagram representations of markov models'. Together they form a unique fingerprint.

  • Cite this

    Derisavi, S., Kemper, P., & Sanders, W. H. (2005). Lumping matrix diagram representations of markov models. 742-751. Paper presented at 2005 International Conference on Dependable Systems and Networks, Yokohama, Japan. https://doi.org/10.1109/DSN.2005.59