Parametrized automata simulation and application to service composition

Walid Belkhir 1 Yannick Chevalier 2 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
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.
Type de document :
Article dans une revue
Journal of Symbolic Computation, Elsevier, 2015, pp.21
Liste complète des métadonnées
Contributeur : Michaël Rusinowitch <>
Soumis le : lundi 1 décembre 2014 - 11:14:34
Dernière modification le : mardi 18 décembre 2018 - 16:38:25


  • HAL Id : hal-01089128, version 1


Walid Belkhir, Yannick Chevalier, Michael Rusinowitch. Parametrized automata simulation and application to service composition. Journal of Symbolic Computation, Elsevier, 2015, pp.21. 〈hal-01089128〉



Consultations de la notice