The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about knowledge
Exploiting symmetry in temporal logic model checking
Formal Methods in System Design - Special issue on symmetry in automatic verification
Formal Methods in System Design - Special issue on symmetry in automatic verification
Model checking multi-agent systems with MABLE
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach
Proceedings of the 7th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Computationally Grounded Theories of Agency
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
A Complete Axiomatization of Knowledge and Cryptography
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Abstraction in model checking multi-agent systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
A Data Symmetry Reduction Technique for Temporal-epistemic Logic
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Parallel Model Checking for Temporal Epistemic Logic
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Abstraction for epistemic model checking of dining cryptographers-based protocols
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
A note on a generalization of the Muddy Children puzzle
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
A complete first-order temporal BDI logic for forest multi-agent systems
Knowledge-Based Systems
Model checking agent knowledge in dynamic access control policies
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automatic verification of parameterised multi-agent systems
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
An epistemic Halpern-Shoham logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We introduce a symmetry reduction technique for model checking temporal-epistemic properties of multi-agent systems defined in the mainstream interpreted systems framework. The technique, based on counterpart semantics, aims to reduce the set of initial states that need to be considered in a model. We present theoretical results establishing that there are neither false positives nor false negatives in the reduced model. We evaluate the technique by presenting the results of an implementation tested against two well known applications of epistemic logic, the muddy children and the dining cryptographers. The experimental results obtained confirm that the reduction in model checking time can be dramatic, thereby allowing for the verification of hitherto intractable systems.