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

Authors:
Xiaowei Huang;Cheng Luo;Ron van der Meyden
Affiliations:
University of New South Wales, Australia;University of New South Wales, Australia;University of New South Wales, Australia
Venue:
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Year:
2010

Citing 5
Cited 0

Reasoning about knowledge

Reasoning about knowledge
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
Improving the Translation from ECTL to SAT

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper develops a new approach to bounded model checking for a logic of knowledge and branching time. Experimental results are presented that demonstrate improved model checking performance, compared with previous approaches, on a range of examples.