Advertisement

Fault Distinguishability of Discrete Event Systems

  • Iwan Tabakow
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3993)

Abstract

The subject of this paper is the theory of fault distinguishable discrete event systems. Any such system is modelled by a live, bounded, and reversible place-transition net. The notions of D-partition of the set of places P of a given place-transition net N and net k-distinguishability are first introduced. The system k-distinguishability measure is obtained in a unique way from the place-invariant matrix. For a large value of k, the system model is extended by using some set of additional places called test points. It is shown that the test point placement process will not change the above-assumed original net properties. Several examples are given.

Keywords

Fault Diagnosis Test Point Discrete Event System Marked Graph Discrete Event Dynamic System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Aghasaryan, A., Fabre, E., Benveniste, A., Boubour, R., Jard, C.: Fault detection and diagnosis in distributed systems: an approach by partially stochastic Petri nets. Discrete Event Dynamic Systems (Special issue on Hybrid Systems) 8(2), 203–231 (1998)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Immanuel, B., Rangarajan, K.: System diagnosis and k-distinguishability in Petri nets. Private communication, India, 14 (2001)Google Scholar
  3. 3.
    Mayeda, W.: Graph Theory, pp. 523–557. John Wiley & Sons Inc., New York (1972)MATHGoogle Scholar
  4. 4.
    Murata, T.: Petri nets and their applications. Journal Soc. Instrum. Control Eng., Japan 22, 6572 (1983)Google Scholar
  5. 5.
    Pietschker, A., Ulrich, A.: A light-weight method for trace analysis to support fault diagnosis in concurrent systems. Journal of Systemics, Cybernetics and Informatics 1(6), 6 (2003)Google Scholar
  6. 6.
    Reisig, W.: Petri Nets. An Introduction, pp. 15, 62–66. Springer, Heidelberg (1985)MATHGoogle Scholar
  7. 7.
    Reisig, W.: A Primer in Petri Net Design, pp. 25–33. Springer, Heidelberg (1992)MATHGoogle Scholar
  8. 8.
    Tabakow, I.G.: Using Petri net invariants in system diagnosis. Petri Net Newsletter, Germany 58, 21–31 (2000)Google Scholar
  9. 9.
    Tabakow, I.G.: An introduction to the place-transition nets k-distinguishability. In: Concurrency, Specification and Programming. Workshop, vol. 2, pp. 355–369. Humboldt-Universität zu Berlin, Germany (2002)Google Scholar
  10. 10.
    Tabakow, I.G.: Using Test Points to Improve the Place –Transition Net k-Distinguishability. In: Proc. of the 7th World Multiconference on Systemics, Cybernetics and Informatics, SCI 2003, Orlando, Florida USA, July 27-30. Computer Science and Engineering II, vol. IX, pp. 173–178 (2003)Google Scholar
  11. 11.
    Tabakow, I.G.: Using place invariants to isolate faults in concurrent systems. Petri Net Newsletter, Germany 68, 10–20 (2005)Google Scholar
  12. 12.
    Tabakow, I.G.: Fault Diagnosis of Discrete Event Systems Using Place Invariants. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3682, pp. 541–547. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Zhou, M.C., DiCesare, F.: Petri net synthesis for discrete event control of manufacturing systems, 233 p. Kluwer Academic, Boston (1993)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Iwan Tabakow
    • 1
  1. 1.Institute of Applied InformaticsWroclaw University of TechnologyPoland

Personalised recommendations