By Topic

Model Checking of Wireless Transaction Protocol

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

3 Author(s)
Liu Xia ; Sch. of Autom. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Huang Qi ; Chen Yong

In order to further verify whether there still exists defect in the design of wireless transaction protocol (WTP), WTP is formally analyzed by model checking. First, WTP is modeled by finite state automatas (FSAs). Then the security property of the protocol is specified by computation tree logic (CTL). Finally, the obtained model and security property are verified by symbolic model verifier (SMV). The result shows that there exists a security flaw - deadlock in WTP.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:7 )

Date of Conference:

March 31 2009-April 2 2009