Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Reasoning about knowledge
Can BDDs compete with SAT solvers on bounded model checking?
Proceedings of the 39th annual Design Automation Conference
Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Tree-Like Counterexamples in Model Checking
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Benefits of Bounded Model Checking at an Industrial Setting
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Logic in Computer Science: Modelling and Reasoning about Systems
Logic in Computer Science: Modelling and Reasoning about Systems
Towards verifying compliance in agent-based web service compositions
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Towards Verifying Contract Regulated Service Composition
ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Under-approximation Heuristics for Grid-based Bounded Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed Symbolic Bounded Property Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying multi-agent systems via unbounded model checking
FAABS'04 Proceedings of the Third international conference on Formal Approaches to Agent-Based Systems
Towards symbolic model checking for multi-agent systems via OBDD's
FAABS'04 Proceedings of the Third international conference on Formal Approaches to Agent-Based Systems
Error detection using BMC in a parallel environment
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Symbolic model checking for temporal-epistemic logic
Logic Programs, Norms and Action
Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the distributed approach, for combining binary decision diagrams with bounded model checking. The algorithm is based on a notion of "seed states" to allow for state-space partitioning. Exploring individual partitions displays benefits arising from the verification of partial state-spaces. When verifying both an industrial model and a scalable benchmark scenario the serial bounded technique was found to be effective. Results for the distributed technique demonstrate that it out-performs the sequential approach for falsifiable formulae. Experimental data indicates that increasing the number of hosts improves verification efficiency.