Efficiency of Automata in Semi-Commutation Verification Techniques

Gérard Cécé 1 Pierre-Cyrille Héam 1 Yann Mainier 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, INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Type de document :
Rapport
[Research Report] RR-5001, INRIA. 2003, pp.20
Liste complète des métadonnées

https://hal.inria.fr/inria-00077039
Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 29 mai 2006 - 11:57:56
Dernière modification le : jeudi 15 février 2018 - 08:48:09
Document(s) archivé(s) le : lundi 5 avril 2010 - 21:33:08

Fichiers

Identifiants

  • HAL Id : inria-00077039, version 1

Citation

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〉

Partager

Métriques

Consultations de la notice

223

Téléchargements de fichiers

330