Artificial intelligence and mathematical theory of computation
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
Simulation, verification and automated composition of web services
Proceedings of the 11th international conference on World Wide Web
Flexible protocol specification and execution: applying event calculus planning using commitments
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
What Is a Conversation Policy?
Issues in Agent Communication
A Social Semantics for Agent Communication Languages
Issues in Agent Communication
Defining interaction protocols using a commitment-based agent communication language
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Specification and verification of agent interaction protocols in a logic-based system
Proceedings of the 2004 ACM symposium on Applied computing
Commitment-based and dialogue-game-based protocols: new trends in agent communication languages
The Knowledge Engineering Review
A Semantic Approach for Designing E-Business Protocols
ICWS '04 Proceedings of the IEEE International Conference on Web Services
On-the-Fly Automata Construction for Dynamic Linear Time Temporal Logic
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Annotation and matching of first-class agent interaction protocols
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Annotation and Matching of First-Class Agent Interaction Protocols
Argumentation in Multi-Agent Systems
Reasoning about web services in a temporal action logic
Reasoning, Action and Interaction in AI Theories and Systems
The ramification problem in temporal databases: an approach with conflicting constraints
Journal of Intelligent Information Systems
The ramification problem in temporal databases: a solution implemented in SQL
Applied Intelligence
| Hi-index | 0.00 |
Temporal logics are well suited for the specification and verification of systems of communicating agents. In this paper we adopt a social approach to agent communication, where communication is described in terms of changes to the social state, and interaction protocols in terms of permissions and commitments among agents. In particular, we make use of a temporal action theory, where a protocol is defined as a set of temporal constraints, which specify the effects and preconditions of the communicative actions on the social state. The paper addresses the problem of combining two protocols to define a new more specialized protocol, and presents a notion of protocol specialization which is based on the well known notion of stuttering equivalence between runs. Moreover, the paper studies sufficient conditions (verifiable from the protocol specification) which guarantee that the combination of two protocols is legal.