Predictability of Sequence Patterns in Discrete Event Systems

Abstract : The problem of predicting the occurrences of a pattern in a partially-observed discrete-event system is studied. The system is modeled by a labeled transition system. The pattern is a set of event sequences modeled by a finite-state automaton. The occurrences of the pattern are predictable if it is possible to infer about any occurrence of the pattern before the pattern is completely executed by the system. An off-line algorithm to verify the property of predictability is presented. The verification is polynomial in the number of states of the system. An on-line algorithm to track the execution of the pattern during the operation of the system is also presented. This algorithm is based on the use of a diagnoser automaton. The results are illustrated using an example from computer systems.
Type de document :
Communication dans un congrès
IFAC World Congress, Aug 2008, Seoul, South Korea. pp.537-543, 2008
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00420497
Contributeur : Hervé Marchand <>
Soumis le : mercredi 30 septembre 2009 - 09:48:20
Dernière modification le : mercredi 11 avril 2018 - 01:54:44
Document(s) archivé(s) le : mardi 15 juin 2010 - 22:19:20

Fichier

p2.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00420497, version 1

Collections

Citation

Thierry Jéron, Hervé Marchand, Sahika Genc, Stéphane Lafortune. Predictability of Sequence Patterns in Discrete Event Systems. IFAC World Congress, Aug 2008, Seoul, South Korea. pp.537-543, 2008. 〈inria-00420497〉

Partager

Métriques

Consultations de la notice

142

Téléchargements de fichiers

108