By Topic

Formal verification of Statecharts using finite-state model checkers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Qianchuan Zhao ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Krogh, B.H.

This paper presents a new approach to the formal verification of properties of discrete control specifications given by Statecharts. Specifications for the Statechart behavior are given by temporal logic expressions for the Statechart computation tree, that is, the tree of possible sequences of Statechart configurations. To take advantage of existing model checking technology, the Statechart is converted into a finite-state representation and the Statechart specification is converted into an equivalent specification for the finite-state system. The definitions and general procedure applies for arbitrary Statechart semantics (a specific semantics results in a particular realization of the procedure). The results are illustrated with examples using the Math-Works Stateflow Toolbox (for Statecharts) and the SMV model checking program. The procedure is realized in an extension of the MATLAB sf2smv command presented in previous papers

Published in:

American Control Conference, 2001. Proceedings of the 2001  (Volume:1 )

Date of Conference:

2001