ThinkMind // DEPEND 2011, The Fourth International Conference on Dependability // View article depend_2011_1_40_40045


Download full article

Efficient and scalable steady-state dependability verification

Authors:
Diana El Rabih
Nihal Pekergin

Keywords: Statistical model checking, Perfect simulation, Dependability verification, Continuous Stochastic Logic (CSL)

Abstract:
We have proposed to perform statistical model checking by combining perfect sampling and statistical hypothesis testing based on single sampling plan method in order to verify steady-state formulas. This approach allows us to consider very large monotone models and to verify rare event properties efficiently. In this paper, we extend our proposed approach by implementing different statistical methods in our verification engine and by comparing their efficiency when we verify steadystate dependability properties for large non monotone models. We show that SPRT statistical method is generally more efficient than the other statistical methods. Moreover, we show that our statistical verification approach is efficient and scalable when we consider large non monotone models.

Pages: 18 to 23

Copyright: Copyright (c) IARIA, 2011

Publication date: August 21, 2011

Published in: conference

ISBN: 978-1-61208-149-6

Location: Nice/Saint Laurent du Var, France

Dates: from August 21, 2011 to August 27, 2011

SERVICES CONTACT
2003 � ThinkMind. All rights reserved.
Read Terms of Service and Privacy Policy.