Abstract
The paper deals with the problem of agents conformance with multiparty protocols. We introduce a notion of conformance of a set of k agents with a multiparty protocol with k roles, which requires the agents to be interoperable and to produce correct executions of the protocol. We introduce conditions that enable each agent to be independently verified with respect to the protocol. We assume that protocols are specified in a temporal action theory and we show that the problem of verifying the conformance of an agent with a protocol can be solved by making use of automata based techniques. Protocols with nonterminating computations, modeling reactive agents, can also be captured in this framework.
| Lingua originale | Inglese |
|---|---|
| Titolo della pubblicazione ospite | Computational Logic in Multi-Agent Systems |
| Volume | 5405 |
| DOI | |
| Stato di pubblicazione | Pubblicato - 2009 |