Abstract
This paper investigates the diagnosability of Rectangular Hybrid Automata (RHAs) (Henzinger et al., 1998) used for modeling a class of hybrid systems. First, a definition of so-called Limited-Time Lookahead diagnosability (LTLa), appropriate for characterising the diagnosability of timed languages accepted by RHAs, is proposed. Then, we provide a systematic approach, for checking the LTLa diagnosability of system modeled with RHAs, and verifying some reasonable assumptions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
