Formal verification of statecharts using finite-state model checkers
Lists
Only you see this
Abstract
This brief concerns the formal verification of properties of statecharts, a hierarchical state machine formalism for designing control-system logic. Various semantics have been defined for statecharts in terms of the microsteps that determine the transitions between statechart configurations. We show how computation tree logic (CTL) specifications for a statechart can be verified using a finite-state model checker such as SMV. The inputs to the model checker are a model and an associated expansion of the CTL formula that reflect the semantics. A Kripke structure with marked states provides the formal relationship between the expanded model and the original statechart structure and CTL specification. The results apply to a general class of semantics and statecharts with bounded behaviors. The approach is illustrated with a small example
BibTeX
@article{zhao2006formal,
author = {Qianchuan Zhao and Bruce H. Krogh},
title = {{Formal verification of statecharts using finite-state model checkers}},
journal = {IEEE Trans. Control. Syst. Technol.},
year = {2006},
doi = {10.1109/tcst.2006.876921},
}Loading related content...