Close category search window
 

Lumping Markov Chains with Silent Steps

Full text access may be available

To access full text, please use your member or institutional sign in.


This paper appears in:
Quantitative Evaluation of Systems, 2006. QEST 2006. Third International Conference on
Date of Conference: 11-14 Sept. 2006
Author(s): Markovski, J.
Dept. of Math. & Comput. Sci., Technische Univ. Eindhoven
Trcka, N.
Page(s): 221 - 232
Product Type: Conference Publications

Available Formats Non-Member Price Member Price
US$31.00 US$10.00
Learn how you can qualify for the best price for the item!
  • Email
  • Print
  • Rights And Permissions

Abstract

A silent step in a dynamic system is a step that is considered unobservable and that can be eliminated. We define a Markov chain with silent steps as a class of Markov chains parameterized with a special real number tau. When tau goes to infinity silent steps become immediate, i.e. timeless, and therefore unobservable. To facilitate the elimination of these steps while preserving performance measures, we introduce a notion of lumping for the new setting. To justify the lumping we first extend the standard notion of ordinary lumping to the setting of discontinuous Markov chains, processes that can do infinitely many transitions in finite time. Then, we give a direct connection between the two lumpings for the case when tau is infinite. The results of this paper can serve as a correctness criterion and a method for the elimination of silent (tau) steps in Markovian process algebras

Index Terms

Index Terms are available to subscribers and IEEE members.

 





Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A non-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2012 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.