Should we learn probabilistic models for model checking? A new approach and an empirical study

• Main Authors: WANG, Jingyi, SUN, Jun, YUAN, Qixia, PANG, Jun
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2017
• Subjects: Genetic algorithm; Model learning; Probabilistic model checking; Software Engineering
• Online Access: https://ink.library.smu.edu.sg/sis_research/4703; https://ink.library.smu.edu.sg/context/sis_research/article/5706/viewcontent/Probalistic_Model_Checking_FASE2017_av.pdf
• Institution: Singapore Management University

Many automated system analysis techniques (e.g., model checking, model-based testing) rely on first obtaining a model of the system under analysis. System modeling is often done manually, which is often considered as a hindrance to adopt model-based system analysis and development techniques. To overcome this problem, researchers have proposed to automatically “learn” models based on sample system executions and shown that the learned models can be useful sometimes. There are however many questions to be answered. For instance, how much shall we generalize from the observed samples and how fast would learning converge? Or, would the analysis result based on the learned model be more accurate than the estimation we could have obtained by sampling many system executions within the same amount of time? In this work, we investigate existing algorithms for learning probabilistic models for model checking, propose an evolution-based approach for better controlling the degree of generalization and conduct an empirical study in order to answer the questions. One of our findings is that the effectiveness of learning may sometimes be limited.