By Topic

Formal Verification of Controller Synthesis Based on Incompletely Specified Finite State Machine Model

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

4 Author(s)
Wei Li ; Sch. of Comput. Sci. & Technol., Anhui Univ., Hefei ; Zhengyi Liu ; Ying Lu ; Jianguo Wu

The paper presents an inclusion relation which is used to verify the process of controller synthesis based on incompletely specified finite state machine model. State transition graph is adopted to describe the behavior of controller. State transition graph STG_org was abstract behavior description of controller synthesis generated before synthesized and state transition graph STGext was reversely extracted from structure realization of controller synthesis. If STG_org contains STGext then corresponding process of controller synthesis was correct. The paper gives a formal verification algorithm of controller synthesis with time complexity O(A1ldrA2ldrt2 (m, n) + B1ldrB2ldrt1 (n)) .In order to further improve time complexity of algorithm, a verifying algorithm with synthetic information guidance was proposed. The algorithm is proved efficient in theory for its time complexity is decreased to O(Cldr(B1ldrt1(n)+A1ldrt2(m, n))).

Published in:

Intelligent Information Technology Application, 2008. IITA '08. Second International Symposium on  (Volume:3 )

Date of Conference:

20-22 Dec. 2008