Observability of hybrid automata by abstraction

Authors:
A. D'Innocenzo;M. D. Di Benedetto;S. Di Gennaro
Affiliations:
Department of Electrical Engineering and Computer Science, University of L'Aquila;Department of Electrical Engineering and Computer Science, University of L'Aquila;Department of Electrical Engineering and Computer Science, University of L'Aquila
Venue:
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Year:
2006

Citing 9
Cited 2

Symbolic Reachability Computation for Families of Linear Vector Fields

Journal of Symbolic Computation
Fault Diagnosis for Timed Automata

FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Computing Approximating Automata for a Class of Linear Hybrid Systems

Hybrid Systems V
Reach Set Computations Using Real Quantifier Elimination

HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Design of Observers for Hybrid Systems

HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Observability of linear hybrid systems

HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Observability of switched linear systems in continuous time

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Reachability of uncertain linear systems using zonotopes

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Controllers for reachability specifications for hybrid systems

Automatica (Journal of IFAC)

Robust test generation and coverage for hybrid systems

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Diagnosability verification for hybrid automata

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we deal with the observability problem of a class of Hybrid Systems whose output is a timed string on a finite alphabet. We determine under which conditions it is always possible to immediately detect, using the observed output, when the system enters a given discrete state. We illustrate how to construct a Timed Automaton that is an abstraction of the given Hybrid System, and that preserves its observability properties. Moreover, we propose a verification algorithm with polynomial complexity for checking the observability of the Timed Automaton, and a constructive procedure for an observer of the discrete state.