Polynomial-time verification of diagnosability of fuzzy discrete event systems

Liu, Fuchun

doi:10.1007/s11432-013-4945-z

Cited by 8 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The necessary and sufficient condition for the existence of a decentralized supervisor to achieve the specification in terms of bisimulation equivalence was presented after introducing the notions of simulation‐based controllability and simulation‐based coobservability, and an algorithm for verifying the simulation‐based coobservability was proposed by constructing a computational tree. As we know, optimal control, failure detection together with its verification are related and interesting topics. We will consider the issues under bisimulation equivalence in our future work.…”

Section: Concluding Remarkmentioning

confidence: 99%

Existence and Verification for Decentralized Nondeterministic Discrete‐Event Systems Under Bisimulation Equivalence

Liu¹,

Zhao²,

Tan³

et al. 2015

Asian Journal of Control

Self Cite

View full text Add to dashboard Cite

In this paper, we study the decentralized control problem for nondeterministic discrete-event systems (DESs) under bisimulation equivalence. In order to exactly achieve the desired specification in the sense of bisimulation equivalence, we present a synchronous composition for the supervised system based on the simulation relation between the specification and the plant. After introducing the notions of simulation-based controllability and simulation-based coobservability, we present the necessary and sufficient condition for the existence of a decentralized supervisor such that the controlled system is bisimilar to the specification, and an algorithm for verifying the simulation-based coobservability is proposed by constructing a computational tree. Key Words: Discrete-event systems, bisimulation equivalence, nondeterministic systems, decentralized supervisory control. prove E(y 2 ) ∩ Σ uc ⊆ E(y 1 ) ∩ Σ uc . Therefore, E(y 1 ) ∩ Σ uc = E(y 2 ) ∩ Σ uc . Rui Zhao received her M.S. and Ph.D. degrees from Liaoning Technical University, China, and Guangdong University of Technology, China, in 2003 and 2013, respectively. She is currently a lecturer at School of Computers, Guangdong University of Technology, China. Her current research interests include failure diagnosis of discrete-event systems, computational intelligence, extension engineering and granular computing.

show abstract

Section: Concluding Remarkmentioning

confidence: 99%

Existence and Verification for Decentralized Nondeterministic Discrete‐Event Systems Under Bisimulation Equivalence

Liu¹,

Zhao²,

Tan³

et al. 2015

Asian Journal of Control

Self Cite

View full text Add to dashboard Cite

show abstract

“…Petri nets have been widely used for modeling and control of DES [1] for more than three decades now. Besides their advantageous graphical representation, they systematically investigate many properties and characteristics of the modeled systems [2].…”

Section: Introductionmentioning

confidence: 99%

Macro liveness graph and liveness of ω-independent unbounded nets

Wang

Gan

Zhou

2015

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Liveness is a basic property of a system and the liveness issue of unbounded Petri nets remains one of the most difficult problems in this field. This work proposes a novel method to decide the liveness of a class of unbounded generalized Petri nets called ω-independent unbounded nets, breaking the existing limits to one-place-unbounded nets. An algorithm to construct a macro liveness graph (MLG) is developed and a critical condition based on MLG deciding the liveness of ω-independent unbounded nets is proposed. Examples are provided to demonstrate its effectiveness.

show abstract

“…To handle these two issues, several works have been reported in the literature. To address the first issue, procedures for diagnosability analysis have been reported in the literature for centralized systems (Jiang, Huang, Chandra, and Kumar, 2001; Tae- Yoo and Lafortune, 2002), decentralized systems (Moreira, Jesus, and Basilio, 2011) and fuzzy systems (Liu, 2014), which do not require the construction of a diagnoser. Instead, they construct a two-dimensional product model and check for a suitable condition over that model.…”

Section: Introductionmentioning

confidence: 99%

A polynomial algorithm for diagnosability of fair discrete event systems

Biswal

Biswas

2015

Systems Science & Control Engineering

View full text Add to dashboard Cite

The discrete event system (DES) has been used for failure detection and diagnosis (FDD) of a wide range of systems. The major reason for resorting to the DES framework is the simplicity in modelling and the low complexity of the FDD algorithms. Pure DES models cannot directly capture systems with continuous dynamics. However, the DES paradigm surmounts the problem by partitioning the continuous state space and capturing each subspace as a discrete state. Conventional methods for FDD consist in constructing a diagnoser, the complexity of which is exponential in the number of system states. In the case of non-diagnosability, the diagnoser needs to be reconstructed after taking suitable measures such as increase in measurements, etc. The conventional schemes have two issues, namely, exponential complexity of diagnoser and erroneous diagnosability conclusions for fair systems. Several works address the first issue where checking diagnosability does not involve a diagnoser and has polynomial time complexity. Once a fault is diagnosable, a diagnoser is constructed for concurrent system monitoring. Regarding the second issue, the abstraction employed in DES modelling may obliterate the fairness property for systems having continuous dynamics, leading to erroneous inferences. Works addressing this issue have augmented fairness to the model and the diagnoser, and new diagnosability conditions have been proposed for fair systems. However, all the Fair DES diagnosability frameworks are based on diagnoser and hence have exponential complexity. In this paper, we purpose a new DES diagnosability framework that suffices for fair systems but at the same time has polynomial complexity.

show abstract

Polynomial-time verification of diagnosability of fuzzy discrete event systems

Cited by 8 publications

References 22 publications

Existence and Verification for Decentralized Nondeterministic Discrete‐Event Systems Under Bisimulation Equivalence

Existence and Verification for Decentralized Nondeterministic Discrete‐Event Systems Under Bisimulation Equivalence

Macro liveness graph and liveness of ω-independent unbounded nets

A polynomial algorithm for diagnosability of fair discrete event systems

Contact Info

Product

Resources

About