The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Web Services Composition Problem: Model and Complexity
Abstract
In the approach taken in this chapter, the composition problem is as follows: given a client service, a goal service and a set of available services, determine if there exists a mediator service that enables the communication between the client and the existing services in order to satisfy the client request, represented by the goal service. In this chapter’s model, available services that have access control constraints are considered. To formally capture these constraints, the chapter defines Web Services as Conditional Communicating Automata (CCA) in which communication is done through bounded ports. This chapter gives a detailed presentation of said model and gives complexity results of the composition problem.
Related Content
|
Jeff Mangers, Christof Oberhausen, Meysam Minoufekr, Peter Plapper.
© 2020.
26 pages.
|
|
Sylvain Maechler, Jean-Christophe Graz.
© 2020.
27 pages.
|
|
Sabrina Petersohn, Sophie Biesenbender, Christoph Thiedig.
© 2020.
41 pages.
|
|
Jonas Lundsten, Jesper Mayntz Paasch.
© 2020.
21 pages.
|
|
Justus Alexander Baron.
© 2020.
31 pages.
|
|
Vasileios Mavroeidis, Petros E. Maravelakis, Katarzyna Tarnawska.
© 2020.
19 pages.
|
|
Hiam Serhan, Doudja Saïdi-Kabeche.
© 2020.
30 pages.
|
|
|