Affiliation:
1. Concordia University, Quebec, Canada
2. Concordia University and Menofia University, Menufia, Egypt
3. University of Sheffield, Sheffield, South Yokshire, UK
Abstract
While modeling interactions using social commitments provides a fundamental basis for capturing flexible and declarative interactions and helps in addressing the challenge of ensuring compliance with specifications, the designers of the system cannot guarantee that an agent complies with its commitments as it is supposed to, or at least an agent doesn't want to violate its commitments. They may still wish to develop efficient and scalable algorithms by which model checking conditional commitments, a natural and universal frame of social commitments, is feasible at design time. However, distinguishing between different but related types of conditional commitments, and developing dedicated algorithms to tackle the problem of model checking conditional commitments, is still an active research topic. In this article, we develop the temporal logic CTL
cc
that extends Computation Tree Logic (CTL) with new modalities which allow representing and reasoning about two types of communicating conditional commitments and their fulfillments using the formalism of interpreted systems. We introduce a set of rules to reason about conditional commitments and their fulfillments. The verification technique is based on developing a new symbolic model checking algorithm to address this verification problem. We analyze the computational complexity and present the full implementation of the developed algorithm on top of the MCMAS model checker. We also evaluate the algorithm's effectiveness and scalability by verifying the compliance of the NetBill protocol, taken from the business domain, and the process of breast cancer diagnosis and treatment, taken from the health-care domain, with specifications expressed in CTL
cc
. We finally compare the experimental results with existing proposals.
Funder
FQRSC
Menofia University
Engineering and Physical Sciences Research Council
Natural Sciences and Engineering Research Council of Canada
Publisher
Association for Computing Machinery (ACM)
Reference55 articles.
1. Thomas Ågotnes Valentin Goranko and Wojciech Jamroga. 2008. Strategic commitment and release in logics for multi-agent systems (extended abstract). http://www.in.tu-clausthal.de/fileadmin/homes/techreports/ifi0801agotnes.pdf. Thomas Ågotnes Valentin Goranko and Wojciech Jamroga. 2008. Strategic commitment and release in logics for multi-agent systems (extended abstract). http://www.in.tu-clausthal.de/fileadmin/homes/techreports/ifi0801agotnes.pdf.
2. Specifying Open Agent Systems: A Survey
3. A Generalized Commitment Machine for 2CL Protocols and Its Implementation
4. Constitutive and regulative specifications of commitment protocols
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献