Diagnosability analysis of bounded Petri nets

In this paper, we propose a method to analyze diagnosability of bounded Petri nets with arbitrary labeling functions. The notion of basis marking is employed to avoid exhaustive enumeration of the set of reachable markings. The novelty consists in removing an assumption that is common in this framew...

Full description

Saved in:
Bibliographic Details
Main Authors: Ning Ran, Jinyuan Hao, Zhou He, Seatzu, Carla
Format: Conference Proceeding
Language:English
Subjects:
Automata
diagnosability
Fault diagnosis
Indexes
Labeling
Media
Petri nets
System recovery
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose a method to analyze diagnosability of bounded Petri nets with arbitrary labeling functions. The notion of basis marking is employed to avoid exhaustive enumeration of the set of reachable markings. The novelty consists in removing an assumption that is common in this framework, namely the Petri net system is deadlock-free after the occurrence of any fault. A finite state automaton, called DF-Verifier, is constructed, which allows one to perform diagnosability analysis by looking at some special cycles and states.
ISSN:1946-0759
DOI:10.1109/ETFA.2018.8502652