Verifying system security using Petri Nets

Abstract

A tool for verifying security properties of data is described, based on colored Petri nets. A conceptual data model for complex applications and a mandatory security model based on the principles of Bell-LaPadula are presented. The tool operates on such models, using the Petri net analysis techniques, based on the reachability graph. The absence of interference of sensitive associations, the reachability of information, and the temporal relationships among data access properties are studied, and conditions on the reachability graph are defined, to guarantee that such properties hold in the system.<>