Reduction of Timed Hybrid Systems

Authors:
S. Di Gennaro;C. Horn;S. R. Kulkarni;P. J. Ramadge
Affiliations:
Dipartimento di Ingegneria Elettrica, Università di L‘Aquila, 67040 Poggio di Roio, L‘Aquila, Italy;Department of Electrical Engineering, Princeton University, Princeton, N.J., 08544;Department of Electrical Engineering, Princeton University, Princeton, N.J., 08544;Department of Electrical Engineering, Princeton University, Princeton, N.J., 08544
Venue:
Discrete Event Dynamic Systems
Year:
1998

Citing 10
Cited 0

Three partition refinement algorithms

SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence

Information and Computation
Automata for modeling real-time systems

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Hybrid Automata with Finite Bisimulatioins

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Minimization of Timed Transition Systems

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
Models for Hybrid Systems: Automata, Topologies, Controllability, Observability

Hybrid Systems
Decidability of Hybrid Systems with Rectangular Differential Inclusion

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Suspension Automata: A Decidable Class of Hybrid Automata

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a class of hybriddynamical systems and obtain conditions under which the behaviorof these systems can be reduced to a finite state automaton.Specifically, we consider timed automata with more general enablingregions coupling the continuous and discrete dynamics than thosepreviously considered. We provide a necessary condition for theexistence of a finite state reduction, together with examplesshowing that this condition is not sufficient. We then give twosufficient conditions that provide a large class of systems withgeneral enabling regions which admit finite reductions.