A lower bound on web services composition

Details A lower bound on web services composition A lower bound on web services composition

2008-04-18

arxiv.org/abs/0804.3105v2

LMCS 4 (2:5) 2008

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-4(2:5)2008

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.

Affiliated with

Also associated with

No associations

Rating

A lower bound on web services composition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A lower bound on web services composition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A lower bound on web services composition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-651402