K-diagnosability of labeled Petri nets

Abstract : This paper presents an approach to solve the problem of K-diagnosability of bounded labeled Petri nets (PNs). We first introduce extended incidence matrix, marking-eventing and extended state equation, which make it possible to record the number of event occurrences for any mar- king reachable from the initial one. Based on the proposed conceptions, we give a mathematical representation for labeled PNs to check diagnosability, and describe K-diagnosability problem of partially observed PNs. Then we propose a recursive algorithm for testing K-diagnosability of PNs, without construction of marking graph or diagnoser.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00780283
Contributor : Nicolas Gouvy <>
Submitted on : Wednesday, January 23, 2013 - 4:17:20 PM
Last modification on : Saturday, March 23, 2019 - 1:24:46 AM
Document(s) archivé(s) le : Wednesday, April 24, 2013 - 3:57:46 AM

File

majecstic2012_submission_9.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00780283, version 1

Citation

Baisi Liu, Mohamed Ghazel, Armand Toguyeni. K-diagnosability of labeled Petri nets. 9ème édition de la conférence MAnifestation des JEunes Chercheurs en Sciences et Technologies de l'Information et de la Communication - MajecSTIC 2012 (2012), Nicolas Gouvy, Oct 2012, Villeneuve d'Ascq, France. ⟨hal-00780283⟩

Share

Metrics

Record views

386

Files downloads

248