Sciweavers

Share
HYBRID
1999
Springer

A New Class of Decidable Hybrid Systems

10 years 2 months ago
A New Class of Decidable Hybrid Systems
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of linear hybrid systems, which are introduced as hybrid systems with linear vector fields in each discrete location. This result is achieved by showing that any such hybrid system admits a finite bisimulation, and by providing an algorithm that computes it using decision methods from mathematical logic.
Gerardo Lafferriere, George J. Pappas, Sergio Yovi
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where HYBRID
Authors Gerardo Lafferriere, George J. Pappas, Sergio Yovine
Comments (0)
books