On feasible cases of checking multi-agent systems behavior
β Scribed by Michael Dekhtyar; Alexander Dikovsky; Mars Valiev
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 301 KB
- Volume
- 303
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
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 nondeterministic polynomial time check algorithms under some realistic structural and semantic restrictions on agent programs and actions.
π SIMILAR VOLUMES
The multi-agent-systems paradigm is becoming more and more popular as a basis for realizing net-based solutions. This development is accompanied by an increasing relevance of security issues. For instance, the potential loss of privacy and other assets is a major concern for, both merchants and cust