Parametrized automata simulation and application to service composition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Symbolic Computation Year : 2015

Parametrized automata simulation and application to service composition

Abstract

The service composition problem asks whether, given a client and a community of available services, there exists an agent (called the mediator) that suitably delegates the actions requested by the client to the available community of services. We address this problem in a general setting where the agents communication actions are parametrized by data from an infinite domain and possibly subject to constraints. For this purpose, we define parametrized automata (PAs), where transitions are guarded by conjunction of equalities and disequalities. We solve the service composition problem by showing that the simulation preorder of PAs is decidable and devising a procedure to synthesize a mediator out of a simulation preorder. We also show that the Nonemptiness problem of PAs is PSPACE-complete.

Dates and versions

hal-01089128 , version 1 (01-12-2014)

Identifiers

Cite

Walid Belkhir, Yannick Chevalier, Michael Rusinowitch. Parametrized automata simulation and application to service composition. Journal of Symbolic Computation, 2015, 69, pp.40-60. ⟨10.1016/j.jsc.2014.09.029⟩. ⟨hal-01089128⟩
320 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More