Petri-Net-Based Model Checking for Privacy-Critical Multiagent Systems

Computation tree logic of knowledge (CTLK) can be used to specify many properties related privacy multiagent systems (MASs). Our previous work defined knowledge-oriented Petri nets (KPNs) formally describe both the interacting/collaborating process multiagents and their epistemic evolutions. KPN-based verification CTLK required obtain all reachable states, transition relation equivalence relations states with respect knowledge, which resulted in a serious state explosion problem thus only fit some small-scale systems. This article adopts reduced ordered binary decision diagram (ROBDD) deal this problem. Especially, ROBDD technique is encode store but not any or relation. However, when verifying formula, must known. To solve problem, we design algorithms compute those prove correctness. We model checking develop tool. A number experiments are done by using famous benchmark about MAS: dining cryptographers protocol (DCP), results illustrate advantages our methods. For example, tool running general PC spends less than 14 h verify DCP 1200 cryptographers, involves 101080 two formulas more 6000 atomic propositions 3600 operators. represents significant advance field checking.