On feasible cases of checking multi-agent systems behavior
The complexity of multi-agent systems behavior properties is studied. The behavior properties are formulated using classical temporal logic languages and are checked relative to the transition system induced by the multi-agent system definition. We show that there are deterministic or nondeterministic polynomial time check algorithms under some realistic structural and semantic restrictions on agent programs and actions. (C) 2002 Elsevier Science B.V. All rights reserved.
multi-agent system complexity temporal logics model checking