Diagnosability Verification for Hybrid Automata
نویسندگان
چکیده
We define a notion of diagnosability for hybrid automata, which generalizes the notion of observability. We propose a procedure to check diagnosability on a given hybrid automaton, and show that the complexity of the verification problem is in PTIME. We apply our procedure to an electromagnetic valve system for camless engines. This paper, because of space limitations, only summarizes the obtained results. An extended and detailed manuscript can be found in the form of a technical
منابع مشابه
Limited-Time Lookahead Diagnosability of Rectangular Hybrid Automata
This paper investigates the diagnosability of Rectangular Hybrid Automata used for modeling a class of hybrid systems. First, a generalized definition of Limited-Time Lookahead diagnosability of timed languages, for multiple failure modes, is proposed. Then, we provide a systematic approach, for checking the LTLa diagnosability of systems modeled with Rectangular Hybrid Automata, and verifying ...
متن کاملGeneralized Robust Diagnosability of Discrete Event Systems
We address the problem of robust diagnosability of discrete event systems described by a class of automata, where each automaton in the class generates a distinct language. We introduce a new definition which generalizes all previous definitions of robust diagnosability; for this reason it is referred here to as generalized robust diagnosability. We also present a necessary and sufficient condi...
متن کاملVerification of Opacity and Diagnosability for Pushdown Systems
In control theory of discrete event systems (DESs), one of the challenging topics is the extension of theory of finite-state DESs to that of infinite-state DESs. In this paper, we discuss verification of opacity and diagnosability for infinite-state DESs modeled by pushdown automata (called here pushdown systems). First, we discuss opacity of pushdown systems and prove that opacity of pushdown ...
متن کاملDiagnosability of Hybrid Systems: Analysis and Verification Cast in Des Framework
The diagnosability analysis proposed for Discrete Event Systems (DES) can be extended to Hybrid Systems (HS) which are systems with combined discrete and continuous behavior. In this paper we propose an approach based on the combination of the diagnosability of the underlying DES and the distinguishability of the continuous modes of the HS. The main idea is to build an observer of the underlyin...
متن کاملDiagnosis in Infinite-State Probabilistic Systems
In a recent work, we introduced four variants of diagnosability (FA, IA, FF, IF) in (finite) probabilistic systems (pLTS) depending whether one considers (1) finite or infinite runs and (2) faulty or all runs. We studied their relationship and established that the corresponding decision problems are PSPACE-complete. A key ingredient of the decision procedures was a characterisation of diagnosab...
متن کامل