Indexing business processes based on annotated finite state automata


Share/Save/Bookmark

Mahleko, B. and Wombacher, A. (2006) Indexing business processes based on annotated finite state automata. In: IEEE International Conerence on Web Services, ICWS 2006, 18-22 Sep 2006, Chicago, USA (pp. pp. 303-311).

[img] PDF
Restricted to UT campus only
: Request a copy
161kB
Abstract: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 processing order as well as any
mandatory or optional requirements for the service. This
matching semantics can be formalized by modelling business
processes as annotated finite state automata (aFSAs)
and deciding emptiness of the intersection aFSA. Computing
the intersection of aFSAs and deciding emptiness are
computationally expensive, being more than quadratic on
the number of states and transitions, 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 discovery. Evaluation of
this approach shows a performance gain of several orders
of magnitude over sequential matching and a linear complexity
with regard to the data set size.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63192
Official URL:http://dx.doi.org/10.1109/ICWS.2006.74
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 238092