Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/inria-00136129
Contributor : Anne Jaigu <>
Submitted on : Monday, March 12, 2007 - 3:06:01 PM
Last modification on : Thursday, January 7, 2021 - 4:18:07 PM
Long-term archiving on: : Wednesday, April 7, 2010 - 1:32:26 AM

Files

PI-1834.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00136129, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

337

Files downloads

389