Using SPIN to Check Nondeterministic Simulink Stateflow Models

In this paper, we consider model checking of nondeterministic finite state machine. Such a machine can be specified as a Simulink Stateflow model, but cannot be directly checked for properties such as reach ability. We present tool chains that use SPIN for checking Markov state machines given as Simulink state flow models. Existing tools and languages as well as new tools introduced here are used in this work. Experimental results comparing our approach to a Prism2PROMELA tool are resented and demonstrate that our approach is more efficient. We also show how a three-valued abstraction can be used to further improve checking efficiency.