Automatic Verification of Statecharts by Abstraction and Refinement of Hierarchical Structure

Abstract

Statechart is a powerful modeling language that is taken in UML. We propose a verification algorithm by abstraction and refinement of hierarchical structure of statechart. The algorithm performs reachability analysis on an abstract model. Subsequently, if the counterexample exists, the algorithm refines an abstract model using it. Moreover, the algorithm checks the validity of counterexample and performs reachability analysis again when it is a spurious counterexample. The algorithm repeats these procedures automatically until a solution is provided. We have implemented a prototype of our verification algorithm and confirmed that there is an effect to downsize state space by experiments.