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

Keyphrases

• Multi-agent Systems 100%
• Petri Nets 100%
• Computation Tree Logic 100%
• Logical Knowledge 100%
• Equivalence Relation 75%
• Transition Relation 75%
• Reachable States 50%
• Knowledge-driven 50%
• Reduced Ordered Binary Decision Diagram (ROBDD) 50%
• Dining Cryptographers 50%
• Privacy Concerns 25%
• Cryptographer 25%
• Multi-agent 25%
• State Explosion Problem 25%
• Small Systems 25%
• Atomic Proposition 25%
• Number of Experiments 25%
• Diagram Technique 25%
• Checking Algorithm 25%

Computer Science

• Multi Agent Systems 100%
• Petri Net 100%
• Model Checking 100%
• Computation Tree 100%
• Equivalence Relation 75%
• Transition Relation 75%
• And-States 50%
• Reachable State 50%
• binary decision diagram 50%
• Dining Cryptographer 50%
• multi-agent 25%
• Diagram Technique 25%
• Privacy Problem 25%
• Model Checking Algorithm 25%
• Atomic Proposition 25%