Efficiency of Automata in Semi-Commutation Verification Techniques - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2003

Efficiency of Automata in Semi-Commutation Verification Techniques

Résumé

Computing the image of a regular language by the transitive closure of a relation is a central question in Regular Model Checking. In a recent paper Bouajjani, Muscholl and Touili proved that the class of APC regular languages is closed under all semi-commutation relations R. Moreover a recursive algorithm on the regular expression is given to compute the image of an APC language by the transitive closure of R. This paper provides a new approach, based on automata, of the same question. Our approach produces a simpler and more efficient algorithm which furthermore works for a larger class of regular languages closed under union, intersection, semi-commutation relations and conjugacy. The existence of this new class, PolC, answered the open question proposed in Bouajjani and al.'s paper.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-5001.pdf (263.77 Ko) Télécharger le fichier

Dates et versions

inria-00077039 , version 1 (29-05-2006)

Identifiants

  • HAL Id : inria-00077039 , version 1

Citer

Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier. Efficiency of Automata in Semi-Commutation Verification Techniques. [Research Report] RR-5001, INRIA. 2003, pp.20. ⟨inria-00077039⟩
97 Consultations
195 Téléchargements

Partager

Gmail Facebook X LinkedIn More