A necessary and sufficient condition for the existence of finite state supervisors in discrete-event systems

1993 ◽  
Vol 38 (1) ◽  
pp. 135-138 ◽  
Author(s):  
T. Ushio
Keyword(s):  
Discrete Event Systems ◽  
Discrete Event ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Event Systems ◽  
Finite State ◽  
Necessary And Sufficient

scholarly journals Failure Diagnosis for Distributed Stochastic Discrete Event Systems

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Xuena Geng ◽  
Dantong Ouyang ◽  
Xiangfu Zhao
Keyword(s):  
Large Scale ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
Failure Diagnosis ◽  
Necessary And Sufficient Condition ◽  
Event Systems ◽  
Communication Events ◽  
Probabilistic Structure ◽  
Stochastic Discrete Event Systems ◽  
Necessary And Sufficient

Because of the complexity of the failure diagnosis for large-scale discrete event systems (DESs), DESs with decentralized information have received a lot of attention. DESs with communication events are defined as distributed DESs. Stochastic discrete event systems (SDESs) are DESs with a probabilistic structure. A-diagnosability is an important property in failure diagnosis of SDES. In this paper, we investigate A-diagnosability in distributed SDESs. We define a local model and global model. Moreover, we construct a synchronized stochastic diagnoser to check A-diagnosability in distributed SDESs. We also propose a necessary and sufficient condition for a distributed SDES to be A-diagnosable. Some examples are described to illustrate our algorithms.

A Polynomial Algorithm for Diagnosability Analysis of Discrete Event Systems

2015 ◽  
Vol 6 (2) ◽  
pp. 1-22
Author(s):  
Eric Gascard ◽  
Zineb Simeu-Abazi ◽  
Bérangère Suiphon
Keyword(s):  
Discrete Event Systems ◽  
Discrete Event ◽  
Finite Sequence ◽  
Finite State Automaton ◽  
Bounded Number ◽  
Event Systems ◽  
Finite State ◽  
Definition Of ◽  
Necessary And Sufficient ◽  
Event Based

The paper deals with the definition of procedure that enables one to determine, for a given plant, if all faults can be detected and located after a finite sequence of observable events. More formally, the diagnosability is the property that every fault can be correctly detected from the observable events of the system after its occurrence no later than a bounded number of events. In this paper, the diagnosability problem of Discrete Event Systems (DESs) is studied. As modeling tool, finite-state automaton in an event-based framework is used. A necessary and sufficient condition of diagnosability of such systems is proposed. The results proposed in this paper allow checking the diagnosability of discrete event systems in an efficient way, i.e. in polynomial time.

A Petri Net Diagnoser for Discrete Event Systems Modeled by Finite State Automata

2015 ◽  
Vol 60 (1) ◽  
pp. 59-71 ◽  
Author(s):  
Felipe Gomes Cabral ◽  
Marcos Vicente Moreira ◽  
Oumar Diene ◽  
Joao Carlos Basilio
Keyword(s):  
Petri Net ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
Finite State Automata ◽  
Event Systems ◽  
Finite State

A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems

2021 ◽  
Vol 181 (4) ◽  
pp. 339-371
Author(s):  
Kuize Zhang
Keyword(s):  
Fault Diagnosis ◽  
Discrete Event Systems ◽  
Discrete Event ◽  
Observation Time ◽  
Infinite Length ◽  
Event Systems ◽  
State Detection ◽  
Finite State ◽  
Common Observation ◽  
Unified Method

The state detection problem and fault diagnosis/prediction problem are fundamental topics in many areas. In this paper, we consider discrete-event systems (DESs) modeled by finite-state automata (FSAs). There exist plenty of results on decentralized versions of the latter problem but there is almost no result for a decentralized version of the former problem. In this paper, we propose a decentralized version of strong detectability called co-detectability which means that if a system satisfies this property, for each generated infinite-length event sequence, in at least one location the current and subsequent states can be determined by observations in the location after a common observation time delay. We prove that the problem of verifying co-detectability of deterministic FSAs is coNP-hard. Moreover, we use a unified concurrent-composition method to give PSPACE verification algorithms for co-detectability, co-diagnosability, and co-predictability of FSAs, without any assumption on or modification of the FSAs under consideration, where co-diagnosability is first studied by [Debouk & Lafortune & Teneketzis 2000], co-predictability is first studied by [Kumar & Takai 2010]. By our proposed unified method, one can see that in order to verify co-detectability, more technical difficulties will be met compared with verifying the other two properties, because in co-detectability, generated outputs are counted, but in the latter two properties, only occurrences of events are counted. For example, when one output was generated, any number of unobservable events could have occurred. PSPACE-hardness of verifying co-diagnosability is already known in the literature. In this paper, we prove PSPACE-hardness of verifying co-predictability.

Sign in / Sign up

Export Citation Format

Share Document