Guarded Variable Automata over Infinite Alphabets - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Guarded Variable Automata over Infinite Alphabets

(1) , (2, 3) , (1)
1
2
3

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.

Dates and versions

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

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More