Cart (Loading....) | Create Account
Close category search window

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

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 )

Date of Publication:

Sept. 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.