In: Mario Bravetti, Leïla Kloul, Gianluigi Zavattaro (Eds.): Lecture Notes in Computer Science, 3670: Formal Techniques for Computer Systems and Business Processes: European Performance Engineering Workshop, EPEW 2005 and International Workshop on Web Services and Formal Methods, WS-FM 2005, Versailles, France, September 1-3, 2005., pages 109-123. Springer-Verlag, November 2005. URL: http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/115499709,.
Abstract: This paper presents a stochastic comparison based method to check state formulas defined over Discrete Time Markov Reward Models. High-level specifications like stochastic Petri nets, Stochastic Automata Networks, Stochastic Process Algebras have been developed to construct large Markov models. However computation of transient and steady-state distributions are limited to relatively small parameter sizes because of the state space explosion problem. Stochastic comparison technique by which both transient and steady-state bounding distributions can be computed, lets to overcome this problem. On the other hand, bounding techniques are useful in Model Checking, since we check generally formulas to see if they meet some bounds or not. We propose to apply stochastic bounding algorithms to construct bounding distributions and to check formulas through these distributions.