Compliance Check in Trust Negotiation Model Based on Petri Nets

Trust negotiation can establish mutual trust between strangers through iterative disclosure of certain kinds of credentials. During the negotiation process, the access control policies are proposed to protect the participants´ privacy information. So, it is a critical problem to conveniently analyze and test the compliance of policies for trust negotiation research. In this paper, we propose a new modeling method based on Petri Nets to describe the negotiation strategy. The safe disclosed sequence algorithm based on the legal firing sequence reachability with minimum initial sub marking is presented. The completeness proof and the complexity analysis of compliance check algorithm is given.