Detectability in Stochastic Discrete Event Systems

  title={Detectability in Stochastic Discrete Event Systems},
  author={Christoforos Keroglou and Christoforos N. Hadjicostis},
Abstract In this paper we define and analyze notions of detectability in stochastic discrete event systems (SDES). More specifically, we introduce the notions of A-detectability and AA-detectability which focus on characterizing our ability to estimate the true current state of a given SDES with increasing certainty as we observe more output symbols. We discuss observer-based techniques that can be used to verify A-detectability, and provide associated necessary and sufficient conditions for… Expand
Revisiting strong detectability of networked discrete-event systems
  • Kuize Zhang, Lei Feng
  • Computer Science
  • 2020
It is proved that strong networked detectability is strictly weaker than its counterpart in [Sasi and Lin 2018] and obtained a polynomial-time verification algorithm for its counterpart without any assumption, which is more efficient than the exponential-time algorithm given by [ Sasi andLin 2018] under several assumptions. Expand
Supervisory Control for Delayed Detectability of Discrete Event Systems
  • Xiang Yin, Shaoyuan Li
  • Computer Science
  • 2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)
  • 2019
This paper proposes a new supervisor synthesis approach that appropriately handles the delayed information in the control problem of Discrete Event Systems, and generalizes previous results on supervisory control of detectability, where only non-delayed information is considered. Expand
Verification of AA-Diagnosability in Probabilistic Finite Automata is PSPACE-Hard
The complexity of verifying the property of AA-diagnosability in probabilistic finite automata is considered and it is established that AA- diagnosability is, in general, a PSPACE-hard problem. Expand
On Periodic Detectability of Probabilistic Boolean Networks
The dynamics of a PBN is converted equivalently into a stochastic automaton in the framework of semi-tensor product (STP) theory to verification of periodic detectability for probabilistic Boolean networks (PBNs) from a brand-new angle. Expand
Fault-Tolerant Control
  • R. Stetter
  • Computer Science
  • Fault-Tolerant Design and Control of Automated Vehicles and Processes
  • 2019
This chapter explains the principles of fault-tolerant control. Points of main emphasis are FTC for continuous processes and discrete event systems, fault identification, fault-tolerant controllersExpand
Revisiting delayed strong detectability of discrete-event systems
Among notions of detectability for a discrete-event system (DES), strong detectability implies that after a finite number of observations to every output/label sequence generated by the DES, theExpand


Detectability of Discrete Event Systems
  • Shaolong Shu, F. Lin
  • Mathematics, Computer Science
  • IEEE Transactions on Automatic Control
  • 2007
The theory developed in this note can be used in feedback control and diagnosis of discrete event systems, and if the system is detectable, then the observer could be used as a diagnoser to diagnose the failure states of the system. Expand
State estimation and detectability of probabilistic discrete event systems
The first step in the approach is to convert a given PDES into a nondeterministic discrete event system and find sufficient conditions for checking probabilistic detectabilities, and the "convergence" of event sequences in PDES is investigated. Expand
Diagnosability of discrete-event systems
The approach to failure diagnosis presented in this paper is applicable to systems that fall naturally in the class of DES's; moreover, for the purpose of diagnosis, most continuous variable dynamic systems can be viewed as DES's at a higher level of abstraction. Expand
Diagnosability of stochastic discrete-event systems
Through the construction of a stochastic diagnoser, offline conditions necessary and sufficient to guarantee A- and AA-diagnosability are determined and shown how it can be used for on-line diagnosis of failure events. Expand
Opacity verification in stochastic discrete event systems
The notion of step-based almost current-state opacity is introduced which provides a measure of opacity for a given system and a verification method is proposed for this probabilistic notion of opacity and its computational complexity is proposed. Expand
Polynomial Test for Stochastic Diagnosability of Discrete-Event Systems
  • J. Chen, Ratnesh Kumar
  • Mathematics, Computer Science
  • IEEE Transactions on Automation Science and Engineering
  • 2013
This paper presents polynomial complexity tests for checking necessity and sufficiency of SS-Diagnosability; sufficiency as well as necessity of Stochastic (S)-DiagnOSability; the latter requires an additional notion of probabilistic equivalence. Expand
Observability of discrete event dynamic systems
A finite state automaton is adopted as a model for discrete event dynamic systems (DEDS). Observations are assumed to be a subset of the event alphabet. Observability is defined as having perfectExpand
On observability of discrete-event systems
The observability of discrete-event systems is investigated and a solution of the supervisory control and observation problem (SCOP) is obtained. Expand
State Observation and Diagnosis of Discrete-Event Systems Described by Stochastic Automata
The problems of state observation and diagnosis are solved for discrete–eventsystems, which are described by stochastic automata, and the diagnostic problem is shown to be, in principle, an observation problem. Expand
Verification of Infinite-Step Opacity and Complexity Considerations
It is shown that infinite-step opacity can be verified via the construction of a set of appropriate initial state estimators and established that the verification of infinite- step opacity is a PSPACE-hard problem. Expand