Now showing 1 - 5 of 5
  • Publication
    Matchmaking for business processes based on conjunctive finite state automata
    ( 2005)
    Wombacher, A.
    ;
    Fankhauser, P.
    ;
    Mahleko, B.
    ;
    Neuhold, E.
    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 de scription for matchmaking. Copyright
  • Publication
    IPSI-PF. A business process matchmaking engine based on annotated finite state automata
    ( 2005)
    Wombacher, A.
    ;
    Mahleko, B.
    ;
    Neuhold, E.
    Success of Web services mainly depends on the availability of tools facilitating usage of technology within the addressed B2B integration problems. One severe problem in loosely coupled systems is service discovery including a sufficient matchmaking definition. The concept for service discovery in web service architecture is UDDI providing limited querying functionality and not being capable to deal with the multiple dimensions of a service, like for example semantic, workflow, or Quality of Service aspects. The IPSI Process Finder (IPSI-PF) realizes service discovery by extending the capabilities of UDDI by matchmaking of service descriptions. The extension is realized such that an integration of additional extensions can be added quite easily.
  • Publication
    P2P evolution: From file-sharing to decentralized workflows
    ( 2004)
    Risse, T.
    ;
    Knezevic, P.
    ;
    Wombacher, A.
  • Publication
    Matchmaking for business processes based on choreographics
    ( 2004)
    Wombacher, A.
    ;
    Frankhauser, P.
    ;
    Mahleko, B.
    ;
    Neuhold, E.J.
  • Publication
    Configuration of distributed message converter systems
    ( 2004)
    Risse, T.
    ;
    Aberer, K.
    ;
    Wombacher, A.
    ;
    Surridge, M.
    ;
    Taylor, S.
    Finding a configuration of a distributed system satisfying performance goals is a complex search problem that involves many design parameters, like hardware selection, job distribution and process configuration. Performance models are a powerful tool to analyze potential system configurations, however, their evaluation is expensive, such that only a limited number of possible configurations can be evaluated. In this paper we present a systematic method to find a satisfactory configuration with feasible effort, based on a two-step approach. First, performing a queuing network analysis a hardware configuration is determined and then a software configuration is incrementally optimized by simulating Layered Queuing Network models. We applied this method to the design of performant EDI converter systems in the financial domain, where increasing message volumes need to be handled due to the growing importance of B2B interaction.