IEEE Transactions on Control Systems Technology · 2017 · 24 citations · 13 references
ComputingComputer ScienceSystems EngineeringFormal MethodsModel-based Systems EngineeringSystems ModelingAutomata TheoryFinite AutomataFinite-state MachinesHybrid SystemsHybrid Systems VerificationModel CheckingAutomata In Formal VerificationContinuous-time State-space ModelsDiscrete-event ModelingPolynomial Time ComplexityPolynomial-time AlgorithmsState Models
Modern industrial systems combine discrete and continuous behaviors and thus are hybrid systems (HSs). In this brief, we introduce a new definition of diagnosability of HSs called h-diagnosability, and we present a method to verify this property. The method is based on a verifier automaton that can be constructed in polynomial time, leading to a smaller computational complexity for the verification of the diagnosability of HS than methods using diagnoser automata. The main idea is to build a verifier of the underlying discrete-event system, taking into account the distinguishability of the system modes based on the continuous state models of the HS.
13
Diagnosability of discrete-event systems
Meera Sampath, Raja Sengupta, Stéphane Lafortune et al. · IEEE Transactions on Automatic Control · 1995 · 1.6K citations