Paper Info
Title
Synthesis of underspecified composite e-services based on automated reasoning
Abstract
In this paper we study automatic composition synthesis of e-Services, based on automated reasoning. We represent the behavior of an e-Service in terms of a deterministic transition syst (or a finite state machine), in which for each action the role of the e-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) a possibly incomplete specification of the sequences of actions that a client would like to realize, and (ii) a set of available e-Services, our technique synthesizes a composite e-Service that (i) uses only the available e-Services and (ii) interacts with the client "in accordance" to the given specification. We also study the computational complexity of the proposed algorithm.
Year
DOI
Venue
2004
10.1145/1035167.1035183
ICSOC
Keywords
Field
DocType
deterministic transition syst,composite e-service,underspecified composite e-services,available e-services,automated reasoning,automatic composition probl,computational complexity,proposed algorithm,propositional dynamic logic,incomplete specification,automatic composition synthesis,finite state machine,satisfiability
Automated reasoning,Data mining,Programming language,Computer science,E-services,Satisfiability,Theoretical computer science,Finite-state machine,Dynamic logic (digital electronics),Computational complexity theory
Conference
ISBN
Citations 
PageRank 
1-58113-871-7
40
1.79
References 
Authors
31
5
Name
Order
Citations
PageRank
Daniela Berardi1106751.72
Giuseppe De Giacomo27004590.40
Maurizio Lenzerini396201522.63
massimo mecella41841168.35
Diego Calvanese510262792.67