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:

Best of 361 papers, acceptance rate <30% on main track.

Research group:

Software Testing Laboratory

Publication Type:

Conference/Workshop Paper

Venue:

Advanced Information Networking and Applications (AINA), 2012 IEEE 26th International Conference on

Abstract

Verifying fault tolerance properties of a distributed system can be achieved by state space analysis via Markov chains. Yet, the power of such exact analytic methods is conned by exponential growth of the chain's state space in the size of the system modeled. We propose a method that alleviates this limit. Lumping is a well known reduction technique that can be applied to a Markov chain to prune redundant information. We propose a system decomposition to employ lumping piecewise on the considerably smaller Markov chains of the subsystems which are much more likely to be tractable. Recomposing the lumped Markov chains of the subsystems results in a state space that is likely to be considerably smaller. An example demonstrates how the limiting window availability (i.e. a fault tolerance property) can be computed for a system while exploiting the combination of lumping and decomposition.

Bibtex

@inproceedings{Mullner4121,
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},
isbn = {978-1-4673-0714-7},
note = {Best of 361 papers, acceptance rate \textless30{\%} on main track.},
month = {March},
year = {2012},
booktitle = {Advanced Information Networking and Applications (AINA), 2012 IEEE 26th International Conference on},
url = {http://www.es.mdu.se/publications/4121-}
}