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

Article, Amsterdam, Netherlands, 2003
Elsevier Science , Theoretical Computer Science, v.303, No. 1
Authors: Valiev M.K., Дехтярь М.И., Диковский А.Я.
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.
Multi-Agent Systems, temporal logics, mu-calculus,model checking, computational complexity
Publication language: english,  pages: 20
Research direction:
Programming, parallel computing, multimedia
English source text:
List of publications citation:
Export link to publication in format:   RIS    BibTeX
About authors:
  • Valiev M. K.,  KIAM RAS
  • Дехтярь М.И.
  • Диковский А.Я.