Anca Muscholl ; Igor Walukiewicz - A lower bound on web services composition

lmcs:824 - Logical Methods in Computer Science, May 15, 2008, Volume 4, Issue 2 - https://doi.org/10.2168/LMCS-4(2:5)2008
A lower bound on web services compositionArticle

Authors: Anca Muscholl ; Igor Walukiewicz

    A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where the construction is understood as a simulation of the specification by a fully asynchronous product of the given services. We show an EXPTIME-lower bound for this problem, thus matching the known upper bound. Our result also applies to richer models of web services, such as the Roman model.


    Volume: Volume 4, Issue 2
    Published on: May 15, 2008
    Imported on: September 21, 2007
    Keywords: Computer Science - Logic in Computer Science,F.1.2,F.3.1

    Classifications

    Mathematics Subject Classification 20201

    11 Documents citing this article

    Consultation statistics

    This page has been seen 1552 times.
    This article's PDF has been downloaded 423 times.