Fault Diagnosis of Backward Conflict-Free Petri Nets by Generalized Markings

This paper addresses the fault diagnosis problem in discrete event systems using backward conflict-free Petri nets, where two different transitions have no common output places. The notion of generalized markings is employed, where the number of tokens in a place can be negative. Based on the special structures of backward conflict-free Petri nets and the generalized marking corresponding to an observed transition sequence, an integer linear programming (ILP) problem is constructed where the numbers of unknown integer variables and constraints are independent of the length of the observed transition sequence. A diagnosis algorithm is proposed by associating two different objective functions with the ILP problem and solving it. The computational efficiency of the proposed algorithm depends on the net structure only, regardless of the length of an observed transition sequence.

Abstract licence: CC BY-NC-ND

40 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.