A lower bound on web services composition
Logic in Computer Science
2015-07-01 v2
Abstract
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.
Keywords
Cite
@article{arxiv.0804.3105,
title = {A lower bound on web services composition},
author = {Anca Muscholl and Igor Walukiewicz},
journal= {arXiv preprint arXiv:0804.3105},
year = {2015}
}