A proof-system for the safe execution of tasks in multi-agent systems

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, we propose an operational semantics based on a proof system for the consistent execution of tasks in a constrained multi-agent setting. The tasks represent services, and are associated with abstract specifications that express conditions on such services. The constraints, contained in the body of the agents, may include - but are not limited to - policies on provided services, and limitations about the use and allocation of bounded resources. The contribution of this work is twofold. Firstly, a formalism and an operational semantics is introduced, to express the way agents can coordinate their requests of services, and to verify that they do not collide with each other's conditions. Then, we prove the soundness and completeness of such operational semantics to be used to verify the correct execution of tasks. © 2002 Springer-Verlag.

Cite

CITATION STYLE

APA

Ciampolini, A., Lamma, E., Mello, P., & Torroni, P. (2002). A proof-system for the safe execution of tasks in multi-agent systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2424 LNAI, pp. 14–26). Springer Verlag. https://doi.org/10.1007/3-540-45757-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free