DocumentCode
2459817
Title
Checking multi-agent systems behavior properties
Author
Dekhtyar, Michael ; Dikovsky, A. ; Valiev, M.
Author_Institution
Dept. of CS, Tver State Univ., Russia
fYear
2002
fDate
2002
Firstpage
308
Lastpage
313
Abstract
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.
Keywords
computational complexity; multi-agent systems; temporal logic; IMPACT agents; deterministic polynomial time; first order logic; multiple agent systems; nondeterministic polynomial time; polynomial time semantics; state transition systems; temporal logic; Artificial intelligence; Books; Communication system control; Intelligent agent; Logic; Mars; Multiagent systems; Polynomials; State estimation; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Artificial Intelligence Systems, 2002. (ICAIS 2002). 2002 IEEE International Conference on
Print_ISBN
0-7695-1733-1
Type
conf
DOI
10.1109/ICAIS.2002.1048119
Filename
1048119
Link To Document