Handbook of formal languages, vol. 1
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
PLM flow-Dynamic Business Process Composition and Execution by Rule Inference
TES '02 Proceedings of the Third International Workshop on Technologies for E-Services
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
E-services: a look behind the curtain
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Method for Composing Process of Non-deterministic Web Services
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Automated composition of e-services: lookaheads
Proceedings of the 2nd international conference on Service oriented computing
Tools for composite web services: a short overview
ACM SIGMOD Record
ComposingWeb Services with Nondeterministic Behavior
ICWS '06 Proceedings of the IEEE International Conference on Web Services
YAWL: yet another workflow language
Information Systems
Prefix-free regular languages and pattern matching
Theoretical Computer Science
Automated realization of business workflow specification
ICSOC/ServiceWave'09 Proceedings of the 2009 international conference on Service-oriented computing
Sliver: a BPEL workflow process execution engine for mobile devices
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Composition of services with nondeterministic observable behavior
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
Computing degree of parallelism for BPMN processes
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
| Hi-index | 0.00 |
The ability to compose existing services to form new functionality is one of the most promising ideas enabled by SOA and the framework of (web) services. A composition or a workflow often involves services distributed over a network and possibly many organizations and administrative domains. Nondeterminism could occur in a composition in at least two ways. The first form is the result of modeling abstraction that hides the detail information and thus makes the "computation" appear non-deterministic. The second form is closely related to "operational optimization", e.g., one may try to invoke more than multiple services for a task, whichever completes first will produce the result and preempts all other services. In this paper, we focus on the latter and measure the complexity of service execution as the amount of needed resources and controlling mechanism for executing nondeterministic service compositions.We formalize the model and complexity problem and develop technical results for this problem in the general setting as well as special cases.