Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.338
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.
WTP, model checking, FSA, CTL, deadlock
Liu Xia, Huang Qi, Chen Yong, "Model Checking of Wireless Transaction Protocol", Computer Science and Information Engineering, World Congress on, vol. 07, no. , pp. 620-623, 2009, doi:10.1109/CSIE.2009.338