Abstraction Framework and Complexity of Model Checking Based

Abstraction Framework and Complexity ofModel Checking Based on the Promela Models* CHEN Daoxi School ofComputer Science and Technology Soochow University Suzhou, 215006, China Suzhou Senior Technical Institute Suzhou, 215009, China Email: chendaoxi6@ ZHANG Guangquan School ofComputer Science and Technology Soochow University Suzhou, 215006, China State Key Lab. ofComputer Science the Chinese Academy of Sciences Beijing, 100080, China Email: gqzhang@ FAN Jianxi School ofComputer Science and Technology Soochow University Suzhou, 215006, China Email: jxfan@ Abstract-Automated model checking shortcomings is prone to state explosion. In this paper, we propose abstraction framework based on Promela models, and transform the source of Promela models to the abstract target of Promela models. On this basis, we analyze the reasons for the complexity of model checking based on Promela models. Finally we reduce the number of state-generated under the condition of verification property unchanged in the ATM example. These show that the abstraction framework reduce the complexity of model checking. Keywords-Promela models, Abstraction framework, Complexity ofmodel checking I. INTRODUCTION Correctness of computer software is critical in today s