Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Verification of Hybrid Automata Diagnosability by Abstraction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Di Benedetto, M.D. ; Dept. of Electr. & Inf. Eng., Univ. of L''Aquila, L''Aquila, Italy ; Di Gennaro, Stefano ; D'Innocenzo, A.

A notion of diagnosability for hybrid systems is defined, which generalizes the common notion of observability. We propose an abstraction procedure to translate a hybrid automaton into a timed automaton, in order to verify observability and diagnosability properties. We introduce a procedure to check diagnosability, and show that for the system class of our abstraction (namely for a subclass of timed automata: the durational graphs) the verification problem belongs to the complexity class P. We apply our procedure to an electromagnetic valve system for camless engines.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 9 )