Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
From MaRDI portal
Publication:5347782
DOI10.1109/TAC.2011.2124950zbMath1368.93384OpenAlexW2110388557MaRDI QIDQ5347782
Thiago C. Jesus, Marcos Vicente Moreira, João Carlos Basilio
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2011.2124950
Formal languages and automata (68Q45) Decentralized systems (93A14) Discrete event control/observation systems (93C65) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (27)
\(K\)-loss robust codiagnosability of discrete-event systems ⋮ Decentralized fault prognosis of discrete event systems with guaranteed performance bound ⋮ Robust predictability of stochastic discrete-event systems and a polynomial-time verification ⋮ Marking diagnosability verification in labeled Petri nets ⋮ Diagnosability enforcement in labeled Petri nets using supervisory control ⋮ Online minimization of sensor activation for supervisory control ⋮ Diagnosability of intermittent sensor faults in discrete event systems ⋮ Verification complexity of a class of observational properties for modular discrete events systems ⋮ Empirical studies in the size of diagnosers and verifiers for diagnosability analysis ⋮ Robust diagnosis of discrete event systems against intermittent loss of observations ⋮ Disjunctive fault prediction of decentralized discrete event systems: verification, predictor design and K-copredictability ⋮ Codiagnosability and coobservability under dynamic observations: transformation and verification ⋮ A language-based diagnosis framework for permanent and intermittent faults ⋮ A new algorithm for testing diagnosability of fuzzy discrete event systems ⋮ Detection and mitigation of classes of attacks in supervisory control systems ⋮ Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications ⋮ Computation of minimal diagnosis bases of discrete-event systems using verifiers ⋮ A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems ⋮ Computation of the delay bounds and synthesis of diagnosers for decentralized diagnosis with conditional decisions ⋮ Computation of minimal event bases that ensure diagnosability ⋮ On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets ⋮ Codiagnosability of networked discrete event systems subject to communication delays and intermittent loss of observation ⋮ Discrete event system identification with the aim of fault detection ⋮ Intermittent fault diagnosability of discrete event systems: an overview of automaton-based approaches ⋮ Diagnosability verification using LTL model checking ⋮ Robustly distributed diagnosis of discrete-event systems and its application to alipay transaction systems ⋮ Verification of safe diagnosability of stochastic discrete-event systems
This page was built for publication: Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
