Synthesis of underspecified composite e-services based on automated reasoning

Abstract

In this paper we study automatic composition synthesis of <i>e</i>-Services, based on automated reasoning. We represent the behavior of an <i>e</i>-Service in terms of a deterministic transition syst (or a finite state machine), in which for each action the role of the <i>e</i>-Service, either as initiator or as servant, is highlighted. In this setting we present an algorithm based on satisfiability in a variant of Propositional Dynamic Logic that solves the automatic composition probl. Specifically, given (<i>i</i>) a possibly incomplete specification of the sequences of actions that a client would like to realize, and (<i>ii</i>) a set of available <i>e</i>-Services, our technique synthesizes a composite <i>e</i>-Service that (<i>i</i>) uses only the available <i>e</i>-Services and (<i>ii</i>) interacts with the client "in accordance" to the given specification. We also study the computational complexity of the proposed algorithm.

DOI: 10.1145/1035167.1035183

Extracted Key Phrases

Statistics

0102030'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

109 Citations

Semantic Scholar estimates that this publication has 109 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Berardi2004SynthesisOU, title={Synthesis of underspecified composite e-services based on automated reasoning}, author={Daniela Berardi and Giuseppe De Giacomo and Maurizio Lenzerini and Massimo Mecella and Diego Calvanese}, booktitle={ICSOC}, year={2004} }