Model checking
Relational transducers for electronic commerce
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Verification of Web Service Flows with Model-Checking Techniques
CW '02 Proceedings of the First International Symposium on Cyber Worlds (CW'02)
Verification of relational transducers for electronic commerce
Journal of Computer and System Sciences - Special issue on PODS 2000
A Peer-to-Peer Approach to Web Service Discovery
World Wide Web
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Business artifacts: An approach to operational specification
IBM Systems Journal
Automated composition of e-services: lookaheads
Proceedings of the 2nd international conference on Service oriented computing
Theoretical Computer Science - Implementation and application of automata
On automating Web services discovery
The VLDB Journal — The International Journal on Very Large Data Bases
WWW '05 Proceedings of the 14th international conference on World Wide Web
Automatic composition of transition-based semantic web services with messaging
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Verification of communicating data-driven web services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ComposingWeb Services with Nondeterministic Behavior
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Specification and verification of data-driven Web applications
Journal of Computer and System Sciences
A probabilistic approach to modeling and estimating the QoS of web-services-based workflows
Information Sciences: an International Journal
Static analysis of active XML systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity and composition of synthesized web services
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Artifact-Centric Business Process Models: Brief Survey of Research Results and Challenges
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Automatic construction of simple artifact-based business processes
Proceedings of the 12th International Conference on Database Theory
Automatic verification of data-centric business processes
Proceedings of the 12th International Conference on Database Theory
Synthesis from Component Libraries
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Evaluating TOP-K Queries over Business Processes
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
QoX-driven ETL design: reducing the cost of ETL consulting engagements
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
A lower bound on web services composition
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Extending online travel agency with adaptive reservations
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Towards formal analysis of artifact-centric business process models
BPM'07 Proceedings of the 5th international conference on Business process management
On the aggregation problem for synthesized web services
Proceedings of the 13th International Conference on Database Theory
Optimal top-k query evaluation for weighted business processes
Proceedings of the VLDB Endowment
Artifact systems with data dependencies and arithmetic
Proceedings of the 14th International Conference on Database Theory
Process-Level composition of executable web services: ”on-the-fly” versus ”once-for-all” composition
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Hi-index | 0.00 |
The paper introduces and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a deterministic finite-state transducer defined in terms of templates for component services. Upon receiving an artifact, an SWM selects a set of available services from a library to realize its templates, and invokes those services to operate on the artifact, in parallel; it produces a numeric value as output (e.g., the total price of a package) by applying synthesis rules. Given an SWM, a library and an input artifact, the aggregation problem is to find a mapping from the component templates of the SWM to available services in the library that maximizes (or minimizes) the output. As opposed to the composition syntheses of Web services, the aggregation problem aims to optimize the realization of a given mediator, to best serve the users@? need. We analyze this problem, and show that its complexity depends on the underlying graph of the mediator: while it is undecidable when such graphs contain even very simple cycles, it is solvable in single-exponential time in the size of the specification (i.e., the total size of the input SWM, library and artifact) for SWMs whose underlying graphs are acyclic. We prove several results of this kind, with matching lower bounds (NP and PSPACE), and analyze restrictions that lead to polynomial-time solutions. In addition, we study the aggregation problem for nondeterministic SWMs (NSWMs). We show that the aggregation problem for NSWMs with various underlying graphs retains the same complexity as its deterministic counterparts. We also provide complexity bounds for determining whether SWMs and NSWMs terminate.