In this paper we present a procedure to analyze the diagnosability of a Petri net system in a decentralized framework. We recall the denition of failure ambiguous strings, i.e., strings that can be both faulty or not in the decentralized case, while can be distinguished in a centralized framework. We rst prove that the absence of such kind of strings guarantees that the system is diagnosable in a decentralized framework. Then, we give an ecient procedure to verify the absence of such kind of strings for both bounded and unbounded Petri net systems. A computational complexity analysis of such procedure is also presented.

Decentralized Diagnosability Analysis of Discrete Event Systems using Petri Nets

PAOLI, ANDREA;
2011

Abstract

In this paper we present a procedure to analyze the diagnosability of a Petri net system in a decentralized framework. We recall the denition of failure ambiguous strings, i.e., strings that can be both faulty or not in the decentralized case, while can be distinguished in a centralized framework. We rst prove that the absence of such kind of strings guarantees that the system is diagnosable in a decentralized framework. Then, we give an ecient procedure to verify the absence of such kind of strings for both bounded and unbounded Petri net systems. A computational complexity analysis of such procedure is also presented.
Proceedings of the 18th IFAC WORLD CONGRESS
1
6
Cabasino, Maria Paola; Giua, Alessandro; Paoli, Andrea; Seatzu, Carla
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/110157
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? ND
social impact