Diagnosability for Patterns in Distributed Discrete Event Systems

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

Yuhong Yan Lina Ye Philippe Dague

Abstract

A pattern is a Finite State Machine that can describe rich faulty scenarios, such as the occurrence of single faults, multiple faults, multiple occurrences of a fault, or the repair of a system. In distributed systems, the events in the pattern, as well as in the system trajectories, are emitted from different components. Our approach is based on distributed simulation and communication to check the recognition of the pattern from the conclusion of local recognition of local patterns. The components communicate observable events and shared communication events, as well as their local recognition results during the checking process without sharing their local models in any way.

How to Cite

Yan, Y., Ye, L., & Dague, P. (2010). Diagnosability for Patterns in Distributed Discrete Event Systems. Annual Conference of the PHM Society, 2(2). https://doi.org/10.36001/phmconf.2010.v2i1.1933
Abstract 15 | PDF Downloads 15

##plugins.themes.bootstrap3.article.details##

Keywords

PHM

References
( Dousson et al., 1993 ) Christophe Dousson, Paul Gaborit, and Malik Ghallab. Situation recognition: Representation and algorithms. In IJCAI, pages 166–174, 1993.

( Gelade and Neven, 2008 ) Wouter Gelade and Frank Neven. Succinctness of the complement and intersection of regular expressions. In Susanne Albers and Pascal Weil, editors, 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), volume 1, pages 325336, Dagstuhl, Germany, 2008. Schloss DagstuhlLeibniz-Zentrum fuer Informatik.

( Guillou et al., 2008 ) Xavier Le Guillou, Marie-Odile Cordier, Sophie Robin, and Laurence Rozé. Chronicles for on-line diagnosis of distributed systems. In ECAI, pages 194–198, 2008.

( Jéron et al., 2006 ) T. Jéron, H. Marchand, S. Pinchinat, and M.O. Cordier. Supervision patterns in discrete event systems diagnosis. Proceedings of the 8th International Workshop on Discrete Event Systems, July 2006.

( Jiang et al., 2001 ) S. Jiang, Z. Huang, V. Chandra, and R. Kumar. A polynomial time algorithm for diagnosability of discrete event systems. IEEE Transactions on Automatic Control, pages 46(8):13181321, 2001.

( Pencolé, 2004 ) Y. Pencolé. Diagnosability analysis of distributed discrete event systems. ECAI’04, pages 43–47, 2004.

( Sampath et al., 1995 ) M. Sampath, R. Sengupta,

S. Lafortune, K. Sinnamohideen, and D. Teneketzis. Diagnosability of discrete event system. IEEE Transactions on Automatic Control, pages 40(9):1555–1575, 1995.

( Schumann and Pencolé, 2007 ) A. Schumann and

Y. Pencolé. Scalable diagnosability checking of event-driven systems. IJCAI-07, pages 575–580, 2007.

( Thompson, 1968 ) Ken Thompson. Regular expression search algorithm. Communications of the ACM, 6(11), June 1968.

( Ye et al., 2009 ) Lina Ye, Philippe Dague, and Yuhong Yan. Pattern diagnosability in distributed discrete event systems. In Proceedings of the 20th International Workshop on Principles of Diagnosis, pages 179–186, Stockholm, Sweden, June 2009.
Section
Poster Presentations