2014
DOI: 10.1109/tac.2013.2294617
|View full text |Cite
|
Sign up to set email alerts
|

On-Line Fault Diagnosis With Partially Observed Petri Nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
32
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 48 publications
(33 citation statements)
references
References 17 publications
1
32
0
Order By: Relevance
“…Concerning diagnosability issues, our contributions extend the results presented in [5] and [30]. Our approach includes partial making measurements [23], is easily implementable for unbounded PNs [31], and can be combined with an algorithm of linear complexity [35]. Concerning predictability issues, this paper extends the results proposed by [18] to PNs.…”
Section: A Relevant Literaturesupporting
confidence: 57%
See 1 more Smart Citation
“…Concerning diagnosability issues, our contributions extend the results presented in [5] and [30]. Our approach includes partial making measurements [23], is easily implementable for unbounded PNs [31], and can be combined with an algorithm of linear complexity [35]. Concerning predictability issues, this paper extends the results proposed by [18] to PNs.…”
Section: A Relevant Literaturesupporting
confidence: 57%
“…The proof of Proposition 1 is detailed in [31] and [35] for bounded PNs. This proposition is extended to unbounded PNs according to the …”
Section: B Partially Observed Petri Netsmentioning
confidence: 99%
“…On the other hand, Petri net has intrinsically distributed nature where the notions of state and action are local, which has been an asset to reduce the computational complexity of solving fault diagnosis problems [122]. Nevertheless, improved results were developed for avoiding complexity by either applying integer linear programming to Petri nets [123] or using partially observed Petri nets [124]. Recently, event-based approaches were applied to fault isolations for continuous dynamic processes where a high-level discrete-event system fault diagnoser was employed to improve the robustness of the fault diagnosis against large environment disturbances [125] or isolate abrupt parameter faults [126].…”
Section: Fault Diagnosis For Discrete-events and Hybrid Systemsmentioning
confidence: 99%
“…The considered timed PNs have a time semantic [24,25] that is defined according to infinite server as server policy (Assumption A1), where each transition is considered as a server for firings and, in a given marking, each transition may fire simultaneously several times depending on its enabling degree; race as choice policy (Assumption A2), where the transition whose firing time elapses first is assumed to be the one that will fire next; and enabling memory as memory policy (Assumption A3), where, at the entrance in a marking, the remaining durations associated with still enabled transitions are kept and decremented and the remaining durations associated with disabled transitions are forgotten. Note that an interaction may exist between enabling memory and infinite server policies.…”
Section: Pns With Temporal Specificationsmentioning
confidence: 99%
“…An algorithm of linear complexity has been also developed in our previous work that limits the length of the timed measured trajectories under test. It considers measured trajectories within a sliding window of constant size 0 instead of increasing size [25] and leads to an algorithm of linear complexity with respect to . Note also that the complexity with respect to is no longer exponential if the set 0 (TR ) is known (Assumption D).…”
Section: Numerical Complexitymentioning
confidence: 99%