Synthesis of Underspecified Composite e-Services based on Automated Reasoning

Proc. of the 2nd Int. Conf. on Service Oriented Computing (ICSOC 2004). 2004.

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 system (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 problem. 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.

@inproceedings{ICSOC-2004,
   title = "Synthesis of Underspecified Composite e-Services based on
Automated Reasoning",
   year = "2004",
   author = "Daniela Berardi and Diego Calvanese and De Giacomo, Giuseppe
and Maurizio Lenzerini and Massimo Mecella",
   booktitle = "Proc. of the 2nd Int. Conf. on Service Oriented Computing
(ICSOC 2004)",
   pages = "105--114",
   doi = "10.1145/1035167.1035183",
}