Matchmaking for Business Processes based on Conjunctive Finite State Automata

Andreas Wombacher, Peter Fankhauser, Bendick Mahleko, Erich Neuhold

    Research output: Contribution to journalArticleAcademicpeer-review

    125 Downloads (Pure)


    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.
    Original languageUndefined
    Article number10.1504/IJBPIM.2005.006960
    Pages (from-to)3-11
    Number of pages9
    JournalInternational journal of business process integration and management
    Issue number1
    Publication statusPublished - 2005


    • Service Discovery
    • IR-61791
    • Business Process
    • EWI-10470
    • METIS-227585
    • Matchmaking

    Cite this