Chicago, Illinois, USA
Sept. 18, 2006 to Sept. 22, 2006
Bendick Mahleko , Fraunhofer Intitute, Germany
Andreas Wombacher , University of Twente, Netherlands
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICWS.2006.74
The existing service discovery infrastructure with UDDI as the de facto standard, is limited in that it does not support more complex searching based on matching business processes. Two business processes match if they agree on their simple services, their processesing order as well as any mandatory or optional requirements for the service. This matching semanctics can be formalized by modelling business processes as annotated finite state autamata (aFSAs) and deciding emptiness of intersection aFSA. Computing the intersection of aFSAs and deciding emptiness are computationally expensive, being more than quadratic on the number of states and transistions, thus does not scale for large service repositories. This paper presents an approach for indexing and matching business processes modeled as aFSAs, for the purpose of service directory. Evaluation of this approach shows a preformance gain of several orders of magnitude over sequential matching and linear complexity with regard to the data size.
Bendick Mahleko, Andreas Wombacher, "Indexing Business Processes based on Annotated Finite State Automata", ICWS, 2006, 2013 IEEE 20th International Conference on Web Services, 2013 IEEE 20th International Conference on Web Services 2006, pp. 303-311, doi:10.1109/ICWS.2006.74