3rd International ICST Workshop on Tools for solving Structured Markov Chains

Research Article

CSRL Model Checking with Closed-Form Bounding Distributions

  • @INPROCEEDINGS{10.4108/ICST.VALUETOOLS2008.4688,
        author={Nihal Pekergin and Sana Youn\'{e}s},
        title={CSRL Model Checking with Closed-Form Bounding Distributions},
        proceedings={3rd International ICST Workshop on Tools for solving Structured Markov Chains},
        publisher={ACM},
        proceedings_a={SMCTOOLS},
        year={2010},
        month={5},
        keywords={Stochastic comparison Stochastic model checking Markov Reward Model class C  CSRL Stochastic model checking},
        doi={10.4108/ICST.VALUETOOLS2008.4688}
    }
    
  • Nihal Pekergin
    Sana Younès
    Year: 2010
    CSRL Model Checking with Closed-Form Bounding Distributions
    SMCTOOLS
    ICST
    DOI: 10.4108/ICST.VALUETOOLS2008.4688
Nihal Pekergin1,*, Sana Younès2,*
  • 1: LACL, Université Paris-Est, 61 Av. Général de Gaulle, 94010, Créteil, France
  • 2: PRiSM, Université de Versailles Saint-Quentin, 45 Av. des Etats Unis, 78000 Versailles, France
*Contact email: nihal.pekergin@univ-pris12.fr, sana.younes@prism.uvsq.fr

Abstract

Continuous Stochastic Logic (CSL) which lets to express real time probabilistic properties on Continuous Time Markov Chains (CTMC) has been augmented by reward structures to check also performability measures. Thus Continuous Stochastic Reward Logic (CSRL) defined on Markov Reward Models (MRM) provides a framework to verify performance-related and as well as dependability-related measures. Probabilistic model checking can be provided through bounding transient, steady-state distributions of the underlying Markov chain, since models are checked to see if the considered measures are guaranteed or not. We propose to extend the model checking algorithm that we have proposed for CSL to the CSRL operators. This method is based on the construction of bounding models having closed-form transient and steady-state distributions by means of Stochastic Comparison technique. In the case when the model can be checked by this method we gain significantly in time and memory complexity. However in case when we can not conclude if the considered formula is satisfied or not, we may apply classical model checking algorithms.