scispace - formally typeset
Proceedings ArticleDOI

An Analyzable Model of Automated Service Negotiation

Reads0
Chats0
TLDR
This paper proposes an analyzable negotiation model between service clients and providers, in the recently introduced language REMES and its corresponding textual service composition language HDCL, and shows how to analyze the negotiation model against timing, cost and utility constraints, by transforming it into the Timed Automata formal framework.
Abstract
Negotiation is a key aspect of Service-Oriented Systems, which is rarely supported by formal models and tools for analysis. Often, service negotiation proceeds with timing, cost and resource constraints, under which the users and providers exchange information on their respective goals, until reaching a consensus. Consequently, a mathematically driven technique to analyze various ways to achieve such goals is beneficial. In this paper, we propose an analyzable negotiation model between service clients and providers, in our recently introduced language REMES and its corresponding textual service composition language HDCL. The model can be viewed as a negotiation interface for different negotiation strategies and protocols, which iterates until an agreement is reached. We show how to analyze the negotiation model against timing, cost and utility constraints, by transforming it into the Timed Automata formal framework. We illustrate our approach through an insurance scenario assuming a form of the Contract Net Protocol for web services.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

Distributed Energy Management Case Study: A Formal Approach to Analyzing Utility Functions

TL;DR: A formal approach to the clients-providers negotiation of distributed energy management is presented, with timed automata semantics that allows us to apply Uppaal-based tools for model-checking various scenarios of service negotiation.

Formal Approaches for Behavioral Modeling and Analysis of Design-time Services and Service Negotiations

Aida Causevic
TL;DR: This thesis presents methods and tools for the specification, modeling, and formal analysis of services and service compositions in SOS, a collection of services that are developed based on several design principles such as loose coupling between services, and a model of service negotiation that includes different negotiation strategies.
References
More filters
Journal ArticleDOI

A theory of timed automata

TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Journal ArticleDOI

Negotiation Decision Functions for Autonomous Agents

TL;DR: A formal model of negotiation between autonomous agents is presented, based on computationally tractable assumptions, demonstrated in the domain of business process management and empirically evaluated.
Journal ArticleDOI

Model-Checking in Dense Real-Time

TL;DR: An algorithm for model-checking, for determining the truth of a TCTL-formula with respect to a timed graph, is developed and it is argued that choosing a dense domain instead of a discrete domain to model time does not significantly blow up the complexity of the model- checking problem.
Proceedings ArticleDOI

Model-checking for real-time systems

TL;DR: An algorithm is developed for model checking, that is, for determining the truth of a TCTL formula with respect to a timed graph, and it is argued that choosing a dense domain, instead of a discrete domain, to model time does not blow up the complexity of the model-checking problem.
Book ChapterDOI

Timed Automata: Semantics, Algorithms and Tools

TL;DR: In this paper, the authors present the concrete and abstract semantics of timed automata (based on transition rules, regions and zones), decision problems, and algorithms for verification for timed systems.
Related Papers (5)