XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
XMC: A Logic-Programming-Based Verification Toolset
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
A lightweight coordination calculus for agent systems
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
A metadata-based architectural model for dynamically resilient systems
Proceedings of the 2007 ACM symposium on Applied computing
Dynamic trust assessment of software services
2nd international workshop on Service oriented software engineering: in conjunction with the 6th ESEC/FSE joint meeting
A Model-Driven CASE tool for developing and verifying regulated open MAS
Science of Computer Programming
Hi-index | 0.00 |
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their BDI logic. The most popular approaches to this in practise have been to model interaction protocols and to model the deontic constraints imposed by individual agents. Both of these approaches are appropriate and necessary but their combination creates the practical problem of ensuring that interaction protocols come into contact with agents that possess compatible deontic constraints. This is essentially an issue of property checking dynamically at run-time. We show how model checking can be applied to this problem.