The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Reasoning about knowledge
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking
Model checking multi-agent systems with MABLE
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
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)
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
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
Symbolic model checking for temporal-epistemic logics
ACM SIGACT News
Symbolic Model Checking of Logics with Actions
Model Checking and Artificial Intelligence
Model checking communicative agent-based systems
Knowledge-Based Systems
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Experimental Evaluation of a Planning Language Suitable for Formal Verification
Model Checking and Artificial Intelligence
Model Checking Communicative Agent-Based Systems
Proceedings of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07
Verification of epistemic properties in probabilistic multi-agent systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Symbolic model checking commitment protocols using reduction
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Model checking epistemic and probabilistic properties of multi-agent systems
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
A complete first-order temporal BDI logic for forest multi-agent systems
Knowledge-Based Systems
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Efficient handling of large signalling-regulatory networks by focusing on their core control
CMSB'12 Proceedings of the 10th international conference on Computational Methods in Systems Biology
Combined model checking for temporal, probabilistic, and real-time logics
Theoretical Computer Science
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
We show that the problem ofmodel checking multi-dimensional modal logics can be reduced to the problem of model checking ARCTL, an extension of the temporal logic CTL with action labels and operators to reason about actions. In particular, we introduce a methodology for model checking a temporal-epistemic logic by building upon an extension of the model checker NuSMV that enables the verification of ARCTL. We briefly present the implementation and report experimental results for the verification of a typical security protocol involving temporal-epistemic properties: the protocol of the dining cryptographers.