Verification of Strict Integrity Policy via Petri Nets

Authors:
Zhao-Li Zhang;Fan Hong;Hai-Jun Xiao
Affiliations:
Huazhong University of Science and Technology, China;Huazhong University of Science and Technology, China;Huazhong University of Science and Technology, China
Venue:
ICSNC '06 Proceedings of the International Conference on Systems and Networks Communication
Year:
2006

Citing 0
Cited 6

Security Analysis of Role Based Access Control Models Using Colored Petri Nets and CPNtools

Transactions on Computational Science IV
Component-based security policy design with colored Petri nets

Semantics and algebraic specification
Modeling TCG-Based secure systems with colored petri nets

INTRUST'10 Proceedings of the Second international conference on Trusted Systems
Using timed colored petri nets and CPN-tool to model and verify TRBAC security policies

VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
Secure interoperation design in multi-domains environments based on colored Petri nets

Information Sciences: an International Journal
Automatic information flow analysis of business process models

BPM'12 Proceedings of the 10th international conference on Business Process Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.