Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Adobe portable document format (pdf)
Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
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.
Thierry Jéron
Thierry.Jeron@irisa.fr
Hervé Marchand
hmarchan@irisa.fr
@TechReport{PI-jeron07a,
Author = {Jéron, T. and Marchand, H. and Genc, S. and Lafortune, S.},
Title = {Predictability of Sequence Patterns in Discrete Event Systems},
Number = {1834},
Institution = {IRISA},
Month = {March},
Year = {2007}
}
Get EndNote Reference (.ref)