Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.2168/LMCS-4(2:5)2008 | Logical Methods in Computer Science |
Keywords | DocType | Volume |
web service,upper bound,lower bound,finite state machine | Journal | 4 |
Issue | ISSN | Citations |
2 | Logical Methods in Computer Science, Volume 4, Issue 2 (May 15,
2008) lmcs:824 | 38 |
PageRank | References | Authors |
1.63 | 15 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anca Muscholl | 1 | 1179 | 74.92 |
| Igor Walukiewicz | 2 | 1239 | 90.24 |