Symbolic Determinisation of Extended Automata

Abstract : We define a symbolic determinisation procedure for a class of infinite-state systems, which consists of automata extended with symbolic variables that may be infinite-state. The subclass of extended automata for which the procedure terminates is characterised as bounded lookahead extended automata. It corresponds to automata for which, in any location, the observation of a bounded-length trace is enough to infer the first transition actually taken. We discuss applications of the algorithm to the verification, testing, and diagnosis of infinite-state systems
Type de document :
Communication dans un congrès
4th IFIP International Conference on Theoretical Computer Science, Aug 2006, Stantiago, Chile, Chile. Springer Science and Business Media, 209/2006, pp.197-212, 2006, IFIP International Federation for Information Processing. 〈10.1007/978-0-387-34735-6_18〉
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00424858
Contributeur : Hervé Marchand <>
Soumis le : lundi 19 octobre 2009 - 08:42:46
Dernière modification le : mercredi 11 avril 2018 - 01:52:08
Document(s) archivé(s) le : mercredi 16 juin 2010 - 00:52:21

Fichier

2006-TCS-Deter.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Thierry Jéron, Hervé Marchand, Vlad Rusu. Symbolic Determinisation of Extended Automata. 4th IFIP International Conference on Theoretical Computer Science, Aug 2006, Stantiago, Chile, Chile. Springer Science and Business Media, 209/2006, pp.197-212, 2006, IFIP International Federation for Information Processing. 〈10.1007/978-0-387-34735-6_18〉. 〈inria-00424858〉

Partager

Métriques

Consultations de la notice

188

Téléchargements de fichiers

114