Checking multi-agent systems behavior properties

The complexity of checking multi-agent systems behavior properties is studied. The behavior properties are formulated using first order temporal logic languages and are checked relative to the state transition systems determined by the multi-agent system definition. Various tight complexity bounds of the behavior properties are established under natural structural and semantic restrictions on agent programs and actions. Several interesting deterministic or nondeterministic polynomial time problem classes are established.