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.

[1]  E. Allen Emerson,et al.  Model Checking and the Mu-calculus , 1996, Descriptive Complexity and Finite Models.

[2]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[3]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

[4]  Jürgen Dix,et al.  Heterogeneous Agent Systems , 2000 .

[5]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

[6]  Viviana Mascardi,et al.  Comparing environments for developing software agents , 2002, AI Commun..

[7]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[8]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[9]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[10]  Yoav Shoham,et al.  Agent-Oriented Programming , 1992, Artif. Intell..

[11]  Michael Wooldridge,et al.  Specifying and Verifying Distributed Intelligence Systems , 1993, EPIA.

[12]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[13]  Michael Wooldridge,et al.  Intelligent agents: theory and practice The Knowledge Engineering Review , 1995 .

[14]  Alexandre Ja. Dikovsky,et al.  On Homeostatic Behavior of Dynamic Deductive Data Bases , 1996, Ershov Memorial Conference.

[15]  Neil Immerman,et al.  Descriptive Complexity and Finite Models , 1997 .

[16]  Alexandre Ja. Dikovsky,et al.  Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs , 1999, Ershov Memorial Conference.