KIAM Main page Web Library  •  Publication Search  Русский 
Publication

, Amsterdam, Netherlands, 2003
Publisher:
Elsevier Science , Theoretical Computer Science, v.303, No. 1, Amsterdam, Netherlands, 2003
Authors: Valiev M.K., Дехтярь М.И., Диковский А.Я.
On Feasible Cases of Checking Multi-Agent Systems Behavior
Abstract:
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.
Keywords:
Multi-Agent Systems, temporal logics, mu-calculus,model checking, computational complexity
Publication language: english, pages: 20
Research direction:
Programming, parallel computing, multimedia
Source text:
  (PDF)