On feasible cases of checking multi-agen
β
Michael Dekhtyar; Alexander Dikovsky; Mars Valiev
π
Article
π
2003
π
Elsevier Science
π
English
β 301 KB
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 deΓΏnition. We show that there are deterministic or nondeterministi