Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Guarded Variable Automata over Infinite Alphabets

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-LILaC - Logique, Interaction, Langue et Calcul
IRIT - Institut de recherche en informatique de Toulouse
Abstract : We define guarded variable automata (GVAs), a simple extension of finite automata over infinite alphabets. In this model the transitions are labelled by letters or variables ranging over an infinite alphabet and guarded by conjunction of equalities and disequalities. GVAs are well-suited for modeling component-based applications such as web services. They are closed under intersection, union, concatenation and Kleene operator, and their nonemptiness problem is PSPACE-complete. We show that the simulation preorder of GVAs is decidable. Our proof relies on the characterization of the simulation by means of games and strategies. This result can be applied to service composition synthesis.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas
Contributor : Walid Belkhir <>
Submitted on : Friday, December 6, 2013 - 9:41:19 AM
Last modification on : Thursday, December 17, 2020 - 1:52:03 PM

Links full text


  • HAL Id : hal-00914779, version 1
  • ARXIV : 1304.6297


Walid Belkhir, Yannick Chevalier, Michael Rusinowitch. Guarded Variable Automata over Infinite Alphabets. 2013. ⟨hal-00914779⟩



Record views