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 result are illustrated using an example from computer systems.
Type de document :
[Research Report] PI 1834, 2007, pp.17
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger
Contributeur : Anne Jaigu <>
Soumis le : lundi 12 mars 2007 - 15:06:01
Dernière modification le : mercredi 11 avril 2018 - 01:52:40
Document(s) archivé(s) le : mercredi 7 avril 2010 - 01:32:26


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00136129, version 1



Thierry Jéron, Hervé Marchand, Sahika Genc, Stéphane Lafortune. Predictability of Sequence Patterns in Discrete Event Systems. [Research Report] PI 1834, 2007, pp.17. 〈inria-00136129〉



Consultations de la notice


Téléchargements de fichiers