Skip to Main content Skip to Navigation
Journal articles

Parametrized automata simulation and application to service composition

Walid Belkhir 1 Yannick Chevalier 2, 3 Michael Rusinowitch 1 
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
2 IRIT-LILaC - Logique, Interaction, Langue et Calcul
IRIT - Institut de recherche en informatique de Toulouse
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.
Document type :
Journal articles
Complete list of metadata
Contributor : Michaël Rusinowitch Connect in order to contact the contributor
Submitted on : Monday, December 1, 2014 - 11:14:34 AM
Last modification on : Monday, July 4, 2022 - 9:41:21 AM

Links full text



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



Record views