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. Categories and Subject Descriptors I.2.11 [Distributed Artificial Intelligence]: Multiagent systems; F.3.1 [Specifying and Verifying and Reasoning about Programs]: Specification techniques; D.2.4 [Software / Program Verification]: Model checking General Terms Verification Keywords dynamic model checking, int...