You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Combining decomposition and reduction for state space analysis of a self-stabilizing system

Authors:

Nils Müllner, Oliver Theel , Martin Fränzle

Note:

Journal of Computer and System Sciences, Number 7, Volume 79

Research group:

Software Testing Laboratory

Publication Type:

Journal article

Venue:

Journal of Computer and System Sciences

DOI:

doi:10.1016/j.jcss.2013.01.022

Abstract

Fault tolerance measures of distributed systems can be calculated precisely by state space analysis of the Markov chain corresponding to the product of the system components. The power of such an approach is inherently confined by the state space explosion, i.e. the exponential growth of the Markov chain in the size of the underlying system. We propose a decompositional method to alleviate this limitation. Lumping is a well-known reduction technique facilitating computation of the relevant measures on the quotient of the Markov chain under lumping equivalence. In order to avoid computation of lumping equivalences on intractably large Markov chains, we propose a system decomposition supporting local lumping on the considerably smaller Markov chains of the subsystems. Recomposing the lumped Markov chains of the subsystems constructs a lumped transition model of the whole system, thus avoiding the construction of the full product chain. An example demonstrates how the limiting window availability (i.e. a particular fault tolerance measure) can be computed for a self-stabilizing system exploiting lumping and decomposition.

Bibtex

@article{Mullner4122,
author = {Nils M{\"u}llner and Oliver Theel and Martin Fr{\"a}nzle},
title = {Combining decomposition and reduction for state space analysis of a self-stabilizing system},
note = {Journal of Computer and System Sciences, Number 7, Volume 79 },
volume = {79},
number = {7},
pages = {1113--1125},
month = {November},
year = {2013},
journal = {Journal of Computer and System Sciences},
url = {http://www.es.mdu.se/publications/4122-}
}