Matchmaking for Business Processes based on Conjunctive Finite State Automata

Share/Save/Bookmark

Wombacher, Andreas and Fankhauser, Peter and Mahleko, Bendick and Neuhold, Erich (2005) Matchmaking for Business Processes based on Conjunctive Finite State Automata. International Journal of Business Process Integration and Management, 1 (1). pp. 3-11. ISSN 1741-8763

[img] PDF
Restricted to UT campus only
: Request a copy
254kB
Abstract:Web services have a potential to enhance B2B e-commerce over the internet by allowing companies and organisations to publish their business processes on service directories where potential trading partners can find them. This can give rise to new business paradigms based on ad-hoc trading relations as companies, particularly small to medium scale, can cheaply and flexibly enter into fruitful contracts, e.g., through subcontracting from big companies. More business process support by the web service infrastructure is however needed before such a paradigm change can materialise. The current infrastructure does not provide sufficient support for searching and matching business processes. We believe that such a service is needed and will enable companies and organisations to establish ad-hoc business relations without relying on manually negotiated frame contracts like RosettaNet PIPs. This paper gives a formal semantics to business process matchmaking and an operational description for matchmaking.
Item Type:Article
Copyright:© 2005 Inderscience Publishers
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/61791
Official URL:http://dx.doi.org/10.1504/IJBPIM.2005.006960
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 227585