Model Checking of Transition-Labeled Finite-State Machines
- Cite this paper as:
- Estivill-Castro V., Rosenblueth D.A. (2011) Model Checking of Transition-Labeled Finite-State Machines. In: Kim T. et al. (eds) Software Engineering, Business Continuity, and Education. ASEA 2011. Communications in Computer and Information Science, vol 257. Springer, Berlin, Heidelberg
We show that recent Model-driven Engineering that uses sequential finite state models in combination with a common sense logic is subject to efficient model checking. To achieve this, we first provide a formal semantics of the models. Using this semantics and methods for modeling sequential programs we obtain small Kripke structures. When considering the logics, we need to extend this to handle external variables and the possibilities of those variables been affected at any time during the execution of the sequential finite state machine. Thus, we extend the construction of the Kripke structure to this case. As a proof of concept, we use a classical example of modeling a microwave behavior and producing the corresponding software directly from models. The construction of the Kripke structure has been implemented using flex, bison and C++, and properties are verified using NuSMV.
KeywordsModel-driven engineering embedded software Model- checking Kripke structures sequential finite-state machines common sense logics
Unable to display preview. Download preview PDF.