On-the-fly algorithm for the service composition problem
On-the-fly algorithm for the service composition problem
The behavioral service composition problem arises when no available service can achieve a target behavior. The composition problem consists in building a special service, an orchestrator, which schedules the actions of the services to produce a behavior equivalent to the target one. In this paper, services are modeled as nondeterministic transition systems and the behavior of the composition realizes the behavior of the target. We propose an algorithm that avoids the full computation of the product of services, and instead constructs the orchestrator incrementally. Unlike most algorithms where the whole state space, which is exponential in the number of services, is visited, the proposed algorithm can find a solution by visiting only the pertinent portion of the state space. We also show that this on-the-fly behavior can be paired with a heuristic to speed up the synthesis.
Aerospace electronics, Complexity theory, Controllability, History, Model checking, Tin, Web services
Farhat, Hikmat
4b7583f4-d03c-425e-a65a-82c0e157e7e6
Feuillade, Guillaume
ae3cc34f-6878-4d69-b692-23d796cfcc81
14 September 2015
Farhat, Hikmat
4b7583f4-d03c-425e-a65a-82c0e157e7e6
Feuillade, Guillaume
ae3cc34f-6878-4d69-b692-23d796cfcc81
Farhat, Hikmat and Feuillade, Guillaume
(2015)
On-the-fly algorithm for the service composition problem.
Badra, Mohamad, Boukerche, Azzedine, Urien, Pascal and Boukerche, Azzedine
(eds.)
In 2015 7th International Conference on New Technologies, Mobility and Security - Proceedings of NTMS 2015 Conference and Workshops.
IEEE..
(doi:10.1109/NTMS.2015.7266511).
Record type:
Conference or Workshop Item
(Paper)
Abstract
The behavioral service composition problem arises when no available service can achieve a target behavior. The composition problem consists in building a special service, an orchestrator, which schedules the actions of the services to produce a behavior equivalent to the target one. In this paper, services are modeled as nondeterministic transition systems and the behavior of the composition realizes the behavior of the target. We propose an algorithm that avoids the full computation of the product of services, and instead constructs the orchestrator incrementally. Unlike most algorithms where the whole state space, which is exponential in the number of services, is visited, the proposed algorithm can find a solution by visiting only the pertinent portion of the state space. We also show that this on-the-fly behavior can be paired with a heuristic to speed up the synthesis.
This record has no associated files available for download.
More information
Published date: 14 September 2015
Additional Information:
Publisher Copyright:
© 2015 IEEE.
Venue - Dates:
7th International Conference on New Technologies, Mobility and Security, NTMS 2015, , Paris, France, 2015-07-27 - 2015-07-29
Keywords:
Aerospace electronics, Complexity theory, Controllability, History, Model checking, Tin, Web services
Identifiers
Local EPrints ID: 492307
URI: http://eprints.soton.ac.uk/id/eprint/492307
PURE UUID: 98d31f9d-0b8b-4771-9246-fb19a2ed503c
Catalogue record
Date deposited: 23 Jul 2024 17:13
Last modified: 24 Jul 2024 02:06
Export record
Altmetrics
Contributors
Author:
Hikmat Farhat
Author:
Guillaume Feuillade
Editor:
Mohamad Badra
Editor:
Azzedine Boukerche
Editor:
Pascal Urien
Editor:
Azzedine Boukerche
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics