Improving Stochastic Model Checking with Stochastic Bounds

Authors:
J. M. Fourneau;N. Pekergin;S. Younes
Affiliations:
Université de Versailles Saint-Quentin en Yvelines;Université de Versailles Saint-Quentin en Yvelines and Universit Paris 1;Université de Versailles Saint-Quentin en Yvelines
Venue:
SAINT-W '05 Proceedings of the 2005 Symposium on Applications and the Internet Workshops
Year:
2005

Citing 0
Cited 2

Stochastic model checking with stochastic comparison

EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
A tool to model traffic aggregation in networks of reconfigurable optical ADD/DROP multiplexers

VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stochastic model checking requires the computation of steady-state or transient distribution for finite or infinite Markov chains for the evaluation of some formulas implying probabilities. However the numerical analysis of Markov chains is much less efficient than the sophisticated algorithmic techniques such as MTBDD developed for the deterministic model checking. We propose to simplify the numerical evaluation of probabilities using stochastic bounds. We show that this approach can be used to bound transient, steady-state and cumulative rewards and may help to evaluate efficiently formulas based on these rewards.