Matchmaking for Business Processes Based on Choreographics

Matchmaking for Business Processes Based on Choreographics

Andreas Wombacher, Peter Fankhauser, Bendick Mahleko, Erich Neuhold
Copyright: © 2004 |Pages: 19
DOI: 10.4018/jwsr.2004100102
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Web services have a potential to enhance B2B e-commerce over the Internet by allowing companies and organizations 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, for example through subcontracting from big companies by simply publishing their business processes and the services they offer. More business process support by the Web service infrastructure is however needed before such a paradigm change can materialize. A service for searching and matchmaking of business processes does not yet exist in the current infrastructure. We believe that such a service is needed and will enable companies and organizations to be able to establish ad-hoc business relations without relying on manually negotiated interorganizational workflows. This article gives a formal semantics to business process matchmaking based on finite state automata extended by logical expressions associated to states.

Complete Article List

Search this Journal:
Reset
Volume 21: 1 Issue (2024)
Volume 20: 1 Issue (2023)
Volume 19: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 18: 4 Issues (2021)
Volume 17: 4 Issues (2020)
Volume 16: 4 Issues (2019)
Volume 15: 4 Issues (2018)
Volume 14: 4 Issues (2017)
Volume 13: 4 Issues (2016)
Volume 12: 4 Issues (2015)
Volume 11: 4 Issues (2014)
Volume 10: 4 Issues (2013)
Volume 9: 4 Issues (2012)
Volume 8: 4 Issues (2011)
Volume 7: 4 Issues (2010)
Volume 6: 4 Issues (2009)
Volume 5: 4 Issues (2008)
Volume 4: 4 Issues (2007)
Volume 3: 4 Issues (2006)
Volume 2: 4 Issues (2005)
Volume 1: 4 Issues (2004)
View Complete Journal Contents Listing