Model checking
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
Formal Methods in System Design
Symbolic model checking for large software specifications
Symbolic model checking for large software specifications
Formalization of fFSM model and its verification
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Test generation for sequential nets of abstract state machines
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Improving model checking with context modelling
Advances in Software Engineering
| Hi-index | 0.00 |
State explosion problem is a major huddle in model checking area. The model described in the temporal model checking is mainly control flow model. The fFSM is a model for describing the control flow aspects in PeaCE(Ptolemy extension as a Codesign Environment), which is a hardware/ software codesign environment to support complex embedded systems. fFSM, like a Statecharts, supports concurrency, hierarchy and global variables. But due to lack of their formality, we defined step semantics for this model and developed its verification tool in the previous work. In this paper, we present the model reduction technique based on dependency analysis to avoid the state explosion problem. As a result, the model, which couldn't be verified before applying the technique, is verified.