Fresh-Variable Automata for Service Composition - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Fresh-Variable Automata for Service Composition

Résumé

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.

Dates et versions

hal-00914778 , version 1 (06-12-2013)

Identifiants

Citer

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⟩
248 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More