loading...
Verification of Strict Integrity Policy via Petri Nets
Tahiti, French Polynesia October 29-November 03
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICSNC.2006.76International Conference on Systems a ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Zhao-Li Zhang, Huazhong University of Science and Technology, China
Fan Hong, Huazhong University of Science and Technology, China
Hai-Jun Xiao, Huazhong University of Science and Technology, China
Strict Integrity Policy is one of important security policies. In this paper, based on Petri net and Biba Model, the Petri net-based definitions of Strict Integrity Policy are formally described in detail. The Petri net-based definitions and the coverability graph allow one to analyze and verify Strict Integrity Policy in Petri net model of a system. Subsequently, an example of the integrity policy is illustrated and the conclusions show that Petri net is not only a concise graphic analysis method, but also suited to formal verification. This verification approach can efficiently improve the integrity policies during the system security design and implementation.
Citation:
Zhao-Li Zhang, Fan Hong, Hai-Jun Xiao, "Verification of Strict Integrity Policy via Petri Nets," icsnc, pp.23, International Conference on Systems and Networks Communication (ICSNC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.