Improved bounded model checking for a fair branching-time temporal epistemic logic

Authors:
Xiaowei Huang;Cheng Luo;Ron van der Meyden
Affiliations:
The University of New South Wales, Australia;The University of New South Wales, Australia;The University of New South Wales, Australia
Venue:
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Year:
2010

Citing 12
Cited 7

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Reasoning about knowledge

Reasoning about knowledge
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounded model checking for the universal fragment of CTL

Fundamenta Informaticae
Verifying epistemic properties of multi-agent systems via bounded model checking

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
ACTLS properties and Bounded Model Checking

Fundamenta Informaticae
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
VerICS 2007 - a Model Checker for Knowledge and Real-Time

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Improving the Translation from ECTL to SAT

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
Model Checking Russian Cards

Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of multi-agent systems via bounded model checking

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence

The BMC method for the existential part of RTCTLK and interleaved interpreted systems

EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Symbolic model checking for temporal-epistemic logic

Logic Programs, Norms and Action
Two approaches to bounded model checking for linear time logic with knowledge

KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Bounded planning for strategic goals with incomplete information and perfect recall

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bounded model checking is a verification technique based on searching for counter-examples to the validity of the specification using an encoding to propositional sastisfiability. The paper identifies a number of inefficiencies in prior encodings for bounded model checking for a logic of knowledge and branching time. An alternate encoding is developed, and theoretical and experimental results are presented that show this leads to improved performance of bounded model checking for a range of examples