Affiliations: Institute of Computer Science, Siedlce University of Natural Sciences and Humanities, Poland | Institute of Computer Science, PAS, Warsaw, Poland, [email protected] | Siedlce University of Natural Sciences and Humanities, Poland | Faculty of Mathematics and Computer Science, University of Łódź, Poland | Institute of Computer Science, PAS, Warsaw, Poland | Institute of Mathematics and Computer Science, Jan Długosz University in Częstochowa, Poland
Note: [] Address for correspondence: Institute of Computer Science, PAS, Jana Kazimierza 5, 01-248 Warsaw, Poland
Abstract: Automating the composition of web services is an object of a growing interest. In our paper [13] we proposed a method for converting the problem of the composition to the problem of building a graph of worlds consisting of formally defined objects, and presented the first phase of this composition aimed at building a graph of types of services (an abstract graph). In this work we propose a method of replacing abstract flows of this graph by sequences of concrete services able to satisfy the user’s request. The method is based on SAT-based reachability checking for (timed) automata with discrete data and parametric assignments.
