| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662471 | Annals of Pure and Applied Logic | 2006 | 27 Pages |
Abstract
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to the transition system induced by the definition of the multi-agent system. We establish various tight complexity bounds of the behavior properties under natural structural and semantic restrictions on agent programs and actions.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
