2004 · 64 citations · 22 references
ComputingComputer ScienceComputer SystemsAlgorithmsAutomationFormal MethodsAutomated ReasoningDeductive ReasoningFinite State Machine ModelingFinite-state MachinesLogic SynthesisFinite State Machine SpecificationSynthesis Of Finite-state MachinesTransition Systems
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.
22
Maurizio Lenzerini · 2002 · 2.5K citations
Sheila A. McIlraith, Tran Cao Son, Honglei Zeng · IEEE Intelligent Systems · 2001 · 1.9K citations
Answering queries using views: A survey
Alon Halevy · The VLDB Journal · 2001 · 1.5K citations
M. Papazoglou, Dimitrios Georgakopoulos · Communications of the ACM · 2003 · 1.1K citations · Full text