Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Knowledge, probability, and adversaries
Journal of the ACM (JACM)
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Reasoning about knowledge
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Model checking
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Reasoning about Uncertainty
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Analysis of probabilistic contract signing
Journal of Computer Security
Probabilistic analysis of an anonymity system
Journal of Computer Security - Special issue on CSFW15
Model Checking Temporal Logics of Knowledge Via OBDDs1
The Computer Journal
Anonymity protocols as noisy channels
Information and Computation
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Planning and acting in partially observable stochastic domains
Artificial Intelligence
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of epistemic properties in probabilistic multi-agent systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Abstraction for epistemic model checking of dining cryptographers-based protocols
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Analyzing multi-agent systems with probabilistic model checking approach
Proceedings of the 34th International Conference on Software Engineering
A logic of probabilistic knowledge and strategy
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Diagnosability in concurrent probabilistic systems
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Bounded planning for strategic goals with incomplete information and perfect recall
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
This paper describes an algorithm for model checking a fragment of the logic of knowledge and probability in multi-agent systems, with respect to a perfect recall interpretation of knowledge and agents' subjective probability. The algorithm has been implemented in the epistemic model checker MCK. Some experiments with the implemented algorithm are reported, in which some properties of agents' probabilistic knowledge are verified in two security protocols: Chaum's Dining Cryptographers protocol, and a protocol for Oblivious Transfer due to Rivest.