Skip to Main content Skip to Navigation
Conference papers

Fresh-Variable Automata for 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 : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Walid Belkhir Connect in order to contact the contributor
Submitted on : Friday, December 6, 2013 - 9:38:30 AM
Last modification on : Friday, January 21, 2022 - 3:09:00 AM

Links full text


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


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, West University of Timisoara Department of Computer Science, Sep 2013, Timisoara, Romania. ⟨hal-00914778⟩



Les métriques sont temporairement indisponibles