Credits and debits on the Internet

Sirbu, Marvin A.

doi:10.1109/6.570823

Cited by 61 publications

(41 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a running example, we study the NetBill protocol developed for buying and selling of encrypted software goods on the Internet (Sirbu, 1998 Merchant's bank Figure 2. The NetBill payment protocol EXAMPLE 1.…”

Section: Running Examplementioning

confidence: 99%

Reasoning about Commitments in the Event Calculus: An Approach for Specifying and Executing Protocols

Yolum

Singh

2004

Annals of Mathematics and Artificial Intelligence

103

107

View full text Add to dashboard Cite

Abstract. Commitments among agents are widely recognized as an important basis for organizing interactions in multiagent systems. We develop an approach for formally representing and reasoning about commitments in the event calculus. We apply and evaluate this approach in the context of protocols, which represent the interactions allowed among communicating agents. Protocols are essential in applications such as electronic commerce where it is necessary to constrain the behaviors of autonomous agents. Traditional approaches, which model protocols merely in terms of action sequences, limit the flexibility of the agents in executing the protocols. By contrast, by formally representing commitments, we can specify the content of the protocols through the agents' commitments to one another. In representing commitments in the event calculus, we formalize commitment operations and domain-independent reasoning rules as axioms to capture the evolution of commitments. We also provide a means to specify protocol-specific axioms through the agents' actions. These axioms enable agents to reason about their actions explicitly to flexibly accommodate the exceptions and opportunities that may arise at run time. This reasoning is implemented using an event calculus planner that helps determine flexible execution paths that respect the given protocol specifications.

show abstract

Section: Running Examplementioning

confidence: 99%

Reasoning about Commitments in the Event Calculus: An Approach for Specifying and Executing Protocols

Yolum

Singh

2004

Annals of Mathematics and Artificial Intelligence

103

107

View full text Add to dashboard Cite

show abstract

“…Protocols, in this sense, replace programming interfaces as an abstraction for programming, e.g., [8]. Composed services will typically interact via protocols, e.g., for negotiation or payment [26]. Protocols open up some interesting questions for us.…”

Section: Protocolsmentioning

confidence: 99%

Trustworthy Service Composition: Challenges and Research Questions

Singh

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Web services have been gathering an increasing amount of attention lately. The raison d'etre of Web services is that we compose them to create new services. For Web services to be effectively composed, however, requires that they be trustworthy and in fact be trusted by their users and other collaborating services. In our conceptual scheme, principals interact as autonomous peers to provide services to one another. Trust is captured as a composite relationship between the trusted and the trusting principal. Principals help each other discover and locate trustworthy services and weed out untrustworthy players. The interactions of the principals combined with the needs of different applications induce interesting structures on the network. We apply multiagent systems techniques to model interactions among the principals. By varying the requirements of different applications, the needs of different principals, the existence of special principals such as trusted authorities, and the mechanisms underlying the interactions, we draw attention to a variety of important settings where Web services would be composed. One, leading to superior methods through which trust can be evolved and managed in realistic servicecomposition settings. Two, studying the relationships between aspects of trust for Web services and the evolution of Web structure.

show abstract

“…In this section, we will exemplify the model checking technique presented in this chapter by means of two case studies: 1) the persuasion/negotiation protocol for agent-based web services ( ) [5]; and 2) the NetBill protocol, a system of micropayments for goods on the Internet [43]. We will also discuss their implementations using an extension of the Concurrency Workbench of New Century (CWB-NC) model checker 12 [15,49], which has been used to check many largescale protocols in communication networking and process control systems.…”

Section: Case Studiesmentioning

confidence: 99%

Model Checking Agent Communication

Bentahar¹,

Meyer

Wang³

2010

Specification and Verification of Multi-Agent Systems

View full text Add to dashboard Cite

Abstract. Model checking is a formal and automatic technique used to verify computational systems (e.g. communication protocols) against given properties. The purpose of this chapter is to describe a model checking algorithm to verify communication protocols used by autonomous agents interacting using dialogue games, which are governed by a set of logical rules. We use a variant of Extended Computation Tree Logic CTL* for specifying these dialogue games and the properties to be checked. This logic, called ACTL*, extends CTL* by allowing formulae to constrain actions as well as states. The verification method uses an on-the-fly efficient algorithm. It is based on translating formulae into a variant of alternating tree automata called Alternating Büchi Tableau Automata (ABTA). We present a tableau-based version of this algorithm and provide the soundness, completeness, termination and complexity results. Two case studies are discussed along with their respective implementations to illustrate the proposed approach. The first one is about an agent-based negotiation protocol and the second one considers a modified version of the NetBill protocol.

show abstract

Credits and debits on the Internet

Cited by 61 publications

References 0 publications

Reasoning about Commitments in the Event Calculus: An Approach for Specifying and Executing Protocols

Reasoning about Commitments in the Event Calculus: An Approach for Specifying and Executing Protocols

Trustworthy Service Composition: Challenges and Research Questions

Model Checking Agent Communication

Contact Info

Product

Resources

About