Handbook of theoretical computer science (vol. B)
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Posit spaces: a performative model of e-commerce
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
On the semantics of conditional commitment
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Protocol conformance for logic-based agents
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
Modeling Agents' Knowledge in Collective Evolutionary Systems
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part I
A unification-based approach to configure generic protocols into agent interaction models
International Journal of Agent-Oriented Software Engineering
Symbolic model checking commitment protocols using reduction
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Verifying conformance of multi-agent commitment-based protocols
Expert Systems with Applications: An International Journal
Engineering commitment-based business protocols with the 2CL methodology
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
Protocols structure interactions among communicating agents. A commitment machine models a protocol in terms of how the commitments of the various parties evolve. Commitment machines thus support flexible behavior while providing a meaningful basis for compliance with a protocol. Unfortunately, current formulations of commitment machines are not sufficiently general or rigorous. This paper develops generalized commitment machines (GCMs) whose elements are described generically in terms of inferences, and whose computations are infinite (thus supporting nonterminating protocols). This paper shows how a GCM can be understood as a nondeterministic Büchi automaton (BA), whose acceptance condition accommodates infinite as well as finite executions. Deterministic BA are readily emulated by conventional software, e.g., a script running in a Web browser. In general, nondeterministic BA may have no equivalent deterministic BA. However, under well-motivated technical conditions, a GCM yields a deterministic Büchi automaton that, although not necessarily equivalent in automata theory terms, is sound (produces only computations allowed by the GCM) and complete (produces the effect of any computation allowed by the GCM).