A logic-based calculus of events
New Generation Computing
Some philosophical problems from the standpoint of artificial intelligence
Readings in nonmonotonic reasoning
interactions
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Verifying Compliance with Commitment Protocols
Autonomous Agents and Multi-Agent Systems
Interaction Protocols as Design Abstractions for Business Processes
IEEE Transactions on Software Engineering
On the potential of norm-governed behavior in different categories of artificial societies
Computational & Mathematical Organization Theory
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dynamic Execution of Coordination Protocols in Open and Distributed Multi-Agent Systems
KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Verifying Agents' Conformance with Multiparty Protocols
Computational Logic in Multi-Agent Systems
Competence checking for the global e-service society using games
ESAW'06 Proceedings of the 7th international conference on Engineering societies in the agents world VII
Participation components for holding roles in multiagent systems protocols
ESAW'04 Proceedings of the 5th international conference on Engineering Societies in the Agents World
| Hi-index | 0.00 |
This paper draws upon our previous work [7, 16] in which we proposed the organisation of services around the concept of artificial agent societies and presented a framework for representing roles and protocols using LTSs. The agent would apply for a role in the society, which would result in its participation in a number of protocols. We advocated the use of the games-based metaphor for describing the protocols and presented a framework for assessing the admission of the agent to the society on the basis of its competence. In this work we look at the subsequent question: what information should the agent receive upon entry?. We can not provide it with the full protocol because of security and overload issues. Therefore, we choose to only provide the actions pertinent to the protocols that the role the agent applied for participates in the society. We employ branching bisimulation for producing a protocol equivalent to the original one with all actions not involving the role translated into silent (τ) actions. However, this approach sometimes results in non-enactable protocols. In this case, we need to repair the protocol by adding the role in question as a recipient to certain protocol messages that were causing the problems. We present three different approaches for repairing protocols, depending on the number of messages from the original protocol they modify. The modified protocol is adopted as the final one and the agent is given the role automaton that is derived from the branching bisimulation process.