Sciweavers

Share
HYBRID
1997
Springer

Hybrid Systems with Finite Bisimulations

9 years 11 months ago
Hybrid Systems with Finite Bisimulations
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructing finite, reachability preserving quotient systems called bisimulations. In this paper, we use recent results from stratification theory, subanalytic sets, and model theory in order to extend the state-of-the-art results on the existence of bisimulations for certain classes of planar hybrid systems.
Gerardo Lafferriere, George J. Pappas, Shankar Sas
Added 07 Aug 2010
Updated 07 Aug 2010
Type Conference
Year 1997
Where HYBRID
Authors Gerardo Lafferriere, George J. Pappas, Shankar Sastry
Comments (0)
books