ACM Home Page
Please provide us with feedback. Feedback
Reflection symmetry detection to reduce the state space of Markovian models
Full text PdfPdf (106 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 47th Annual Southeast Regional Conference table of contents
Clemson, South Carolina
SESSION: Systems and modeling table of contents
Article No. 80  
Year of Publication: 2009
ISBN:978-1-60558-421-8
Authors
Ruth Lamprecht  College of William & Mary, Williamsburg, VA
Peter Kemper  College of William & Mary, Williamsburg, VA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 11,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1566445.1566551
What is a DOI?

ABSTRACT

A model-based evaluation of a system's design often considers to what degree components need to be available multiple times in order to reach a desired level of availability, reliability or dependability. Multiple components of the same kind then lead to models with regular structures. In stochastic models, especially Markovian models, such regularities have been studied for a long time and are used to establish lumpability results that help to achieve a significant state space reduction and alleviate the effects of the infamous state space explosion problem. In this paper, we introduce a new procedure to identify and reduce Markovian models that are built in a compositional manner based on sharing state variables. This procedure can also detect symmetries based on reflection in spatial models where state variables can commute. The results extend existing work of Obal, McQuinn, and Sanders and will contribute to Möbius, a multi-paradigm, multi-solution framework for the model-based dependability and performance assessment of systems.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
S. Derisavi. A symbolic algorithm for optimal Markov chain lumping. Lecture Notes in Comp. Sci., 4424:139--154, 2007.
 
4
 
5
 
6
W. H. Sanders and J. F. Meyer. Reduced base model construction methods for stochastic activity networks. IEEE Journal on Selected Areas in Communications, 9(1):25--36, Jan. 1991.

Collaborative Colleagues:
Ruth Lamprecht: colleagues
Peter Kemper: colleagues