A lower bound on web services composition

Authors:
Anca Muscholl;Igor Walukiewicz
Affiliations:
LaBRI, Université Bordeaux 1 and CNRS, Talence cedex, France;LaBRI, Université Bordeaux 1 and CNRS, Talence cedex, France
Venue:
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Year:
2007

Citing 8
Cited 13

Alternation

Journal of the ACM (JACM)
On Communicating Finite-State Machines

Journal of the ACM (JACM)
E-services: a look behind the curtain

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conversation protocols: a formalism for specification and verification of reactive electronic services

Theoretical Computer Science - Implementation and application of automata
Specification and verification of data-driven web services

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automatic composition of transition-based semantic web services with messaging

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Automated composition of web services by planning at the knowledge level

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Web Services: Concepts, Architectures and Applications

Web Services: Concepts, Architectures and Applications

Timed Specification For Web Services Compatibility Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)
Complexity and composition of synthesized web services

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimum-cost delegation in service composition

Theoretical Computer Science
Timed Properties-Aware Asynchronous Web Service Composition

OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Protocol-Based Web Service Composition

ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Controller/Orchestrator Synthesis via Filtration

Electronic Notes in Theoretical Computer Science (ENTCS)
On the aggregation problem for synthesized web services

Proceedings of the 13th International Conference on Database Theory
Composition of Services with Constraints

Electronic Notes in Theoretical Computer Science (ENTCS)
Automated composition of nondeterministic stateful services

WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Hardness of preorder checking for basic formalisms

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Hardness of preorder checking for basic formalisms

Theoretical Computer Science
On the aggregation problem for synthesized Web services

Journal of Computer and System Sciences
Semi-Automated Software Composition Through Generated Components

Proceedings of International Conference on Information Integration and Web-based Applications & Services

Quantified Score

Hi-index	0.01

Visualization

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.