Predictability of Sequence Patterns in Discrete Event Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Predictability of Sequence Patterns in Discrete Event Systems


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.
Fichier principal
Vignette du fichier
PI-1834.pdf (262.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00136129 , version 1 (12-03-2007)


  • 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⟩
156 View
240 Download


Gmail Facebook Twitter LinkedIn More