State Observer for DES Under Partial Observation with Time Petri Nets

Ghazel, Mohamed; Toguyéni, Armand; Yim, Pascal

doi:10.1007/s10626-009-0060-0

Cited by 43 publications

(25 citation statements)

References 8 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, unlike the method developed in [6], the approach proposed in this paper is less restrictive. Indeed, Ghazel et al [6] restrict their attention to TPN model with a finite state class space-the SCG is explicitly constructed.…”

Section: Estimation Proceduresmentioning

confidence: 99%

See 2 more Smart Citations

Marking Estimation of P-Time Petri Nets With Unobservable Transitions

Bonhomme¹

2015

IEEE Trans. Syst. Man Cybern, Syst.

View full text Add to dashboard Cite

This paper focuses on the problem of estimating the marking of an unlabeled P-time Petri net with partial information modeled by unobservable transitions. The proposed approach is based on a novel state observer synthesis method under partial observation. A procedure that, given a sequence of observable transitions with their firing time instants, allows to determine the set of markings consistent with the considered observation is given. The method relies on the feasibility in time (called schedulability) of particular firing sequences, namely the candidates firing sequences. Moreover, although time is taken into consideration, the proposed technique is not hampered by the state space explosion problem as it relies on the underlying untimed structure of the P-time model considered-the building of the state class graph is not necessary.

show abstract

Section: Estimation Proceduresmentioning

confidence: 99%

“…Indeed, Ghazel et al [6] restrict their attention to TPN model with a finite state class space-the SCG is explicitly constructed.…”

Section: Estimation Proceduresmentioning

confidence: 99%

See 1 more Smart Citation

Marking Estimation of P-Time Petri Nets With Unobservable Transitions

Bonhomme¹

2015

IEEE Trans. Syst. Man Cybern, Syst.

View full text Add to dashboard Cite

show abstract

“…The diagnosis of discrete event systems based on Petri nets (PN) has been an active research area in the last decades [3], [12]. In some works [13]- [22], untimed PN is used and in others [23]- [27] systems are modeled by PN with time. There are mainly two time interpretations of PN in which transitions are associated with time delays: timed PN [28] and time PN (TPN) [29].…”

Section: Introductionmentioning

confidence: 99%

“…An external observer can detect the firings of some transitions and the markings of some places. In [13]- [15], [18], [20]- [27], the authors assume that only a subset of transitions is observable. Instead, in [17], the markings of some places are observable, while the firings of transitions cannot be observed.…”

Section: Introductionmentioning

confidence: 99%

Diagnosis of Time Petri Nets Using Fault Diagnosis Graph

Wang

Mahulea

Silva

2015

IEEE Trans. Automat. Contr.

View full text Add to dashboard Cite

This paper proposes an online approach for fault diagnosis of timed discrete event systems modeled by Time Petri Net (TPN). The set of transitions is partitioned into two subsets containing observable and unobservable transitions, respectively. Faults correspond to a subset of unobservable transitions. In accordance with most of the literature on discrete event systems, we define three diagnosis states, namely normal, faulty and uncertain states, respectively. The proposed approach uses a fault diagnosis graph, which is incrementally computed using the state class graph of the unobservable TPN. After each observation, if the part of FDG necessary to compute the diagnosis states is not available, the state class graph of the unobservable TPN is computed starting from the consistent states. This graph is then optimized and added to the partial FDG keeping only the necessary information for computation of the diagnosis states. We provide algorithms to compute the FDG and the diagnosis states. The method is implemented as a software package and simulation results are included.Index Terms-Discrete event system (DES), fault diagnosis, Petri net, timed systems.

show abstract

On‐the‐Fly and Incremental Technique for Fault Diagnosis of Discrete Event Systems Modeled by Labeled Petri Nets

Liu

Ghazel

Toguyéni³

2017

Asian Journal of Control

Self Cite

View full text Add to dashboard Cite

In this paper, we develop an on‐the‐fly and incremental technique for fault diagnosis of discrete event systems modeled by labeled Petri nets, in order to tackle the combinatorial explosion problem. K‐diagnosability, diagnosability, Kmin (the minimum K ensuring diagnosability) and on‐line diagnosis are solved on the basis of the on‐the‐fly and incremental building of two structures, called respectively fault marking graph and fault marking set graph, in parallel. We build on existing results, namely those establishing necessary and sufficient conditions for diagnosability, but we bring mechanisms to make the checking of such conditions potentially more efficient. We show that, in general, analyzing or even building the whole reachability graph is unnecessary to analyze diagnosability and build an on‐line diagnoser. Our technique was implemented in a prototype tool called OF‐PENDA, and a railway level crossing benchmark is used to make a comparative discussion pertaining to efficiency in terms of time and memory relative to some existing approaches.

show abstract

State Observer for DES Under Partial Observation with Time Petri Nets

Cited by 43 publications

References 8 publications

Marking Estimation of P-Time Petri Nets With Unobservable Transitions

Marking Estimation of P-Time Petri Nets With Unobservable Transitions

Diagnosis of Time Petri Nets Using Fault Diagnosis Graph

On‐the‐Fly and Incremental Technique for Fault Diagnosis of Discrete Event Systems Modeled by Labeled Petri Nets

Contact Info

Product

Resources

About