The University of Southampton
University of Southampton Institutional Repository

Composition of partially-observable services

Composition of partially-observable services
Composition of partially-observable services

In this paper, we tackle the problem of controlling the behavior of independent, partially observable services so that they collectively achieve a desired behavior (specification). The solution consists of synthesizing an orchestrator to coordinate the actions of the services, modeled as labeled transition systems, while having partial knowledge about their states. We show that an orchestrator exists only if the set of services is controllable where controllability is defined in terms of a set of message controllable relations. We present two algorithms to solve the problem, prove their correctness, and study their complexity. One of them is a novel backtracking algorithm that builds the solution incrementally, which makes it suitable as a starting point for developing heuristics to solve this hard problem. The results of the backtracking algorithm on a test case are promising.

Automated planning, behavior composition, partial observation, supervisory control, web services
2169-3536
2281-2290
Farhat, Hikmat
4b7583f4-d03c-425e-a65a-82c0e157e7e6
Farhat, Hikmat
4b7583f4-d03c-425e-a65a-82c0e157e7e6

Farhat, Hikmat (2018) Composition of partially-observable services. IEEE Access, 7, 2281-2290, [8571226]. (doi:10.1109/ACCESS.2018.2885948).

Record type: Article

Abstract

In this paper, we tackle the problem of controlling the behavior of independent, partially observable services so that they collectively achieve a desired behavior (specification). The solution consists of synthesizing an orchestrator to coordinate the actions of the services, modeled as labeled transition systems, while having partial knowledge about their states. We show that an orchestrator exists only if the set of services is controllable where controllability is defined in terms of a set of message controllable relations. We present two algorithms to solve the problem, prove their correctness, and study their complexity. One of them is a novel backtracking algorithm that builds the solution incrementally, which makes it suitable as a starting point for developing heuristics to solve this hard problem. The results of the backtracking algorithm on a test case are promising.

This record has no associated files available for download.

More information

Published date: 9 December 2018
Additional Information: Publisher Copyright: © 2013 IEEE.
Keywords: Automated planning, behavior composition, partial observation, supervisory control, web services

Identifiers

Local EPrints ID: 492309
URI: http://eprints.soton.ac.uk/id/eprint/492309
ISSN: 2169-3536
PURE UUID: 5200335c-f674-48b3-8830-071e71b79973
ORCID for Hikmat Farhat: ORCID iD orcid.org/0000-0002-5043-227X

Catalogue record

Date deposited: 23 Jul 2024 17:13
Last modified: 24 Jul 2024 02:06

Export record

Altmetrics

Contributors

Author: Hikmat Farhat ORCID iD

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×