Fresh-Variable Automata for 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
2 IRIT - Institut de recherche en informatique de Toulouse
Abstract : To model Web services handling data from an infinite domain, or with multiple sessions, we introduce fresh-variable automata, a simple extension of finite-state automata in which some transitions are labeled with variables that can be refreshed in some specified states. We prove several closure properties for this class of automata and study their decision problems. We then introduce a notion of simulation that enables us to reduce the Web service composition problem to the construction of a simulation of a target service by the asynchronous product of existing services, and prove that this construction is computable.
Type de document :
Communication dans un congrès
SYNASC 2013 -15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2013, Timisoara, Romania. IEEE, 2013
Liste complète des métadonnées
https://hal.inria.fr/hal-00914778
Contributeur : Walid Belkhir <>
Soumis le : vendredi 6 décembre 2013 - 09:38:30
Dernière modification le : mercredi 12 septembre 2018 - 17:46:01

Lien texte intégral

arxiv

Identifiants

  • HAL Id : hal-00914778, version 1
  • ARXIV : 1302.4205

Collections

INRIA | UNIV-FCOMTE | UNIV-TLSE3 | UNIV-BM | FEMTO-ST | UNIV-BM-THESE | UNIV-TLSE2 | UNIV-LORRAINE | SMS | LORIA-FM | LORIA

Citation

Walid Belkhir, Yannick Chevalier, Michael Rusinowitch. Fresh-Variable Automata for Service Composition. SYNASC 2013 -15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2013, Timisoara, Romania. IEEE, 2013. 〈hal-00914778〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

351

Contact


archive-ouverte@inria.fr