(Enter summary)
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. (Update)
Context of citations to this paper: More
.... for constructing finite graph quotients which have equivalent reachability properties with analytic vector fields is presented in [19], 20] A similar construction which characterizes reachability of a continuous system in terms of an associated discrete system may be...
.... in a systematic way.At the same it gives us access to classes of decidability and reachability results for hybrid automata [10,23, 40, 53, 54, 61, 65]. These can be used as theoretical or numerical tools for formal verification of the safety or other performance aspects of a...
Cited by: More
Reachability Analysis of Hybrid Systems Using - Bisimulations Gerardo..
(Correct)
Supervisory Control of Hybrid Systems - Koutsoukos, Antsaklis, Stiver.. (2000)
(Correct)
Discrete Abstractions of Hybrid Systems - Alur, Henzinger, Lafferriere.. (2000)
(Correct)
Similar documents (at the sentence level): More
39.7%: Hybrid Systems With Finite Bisimulations - Lafferriere, PAPPAS, SASTRY (1998)
(Correct)
6.8%: Reachability Analysis of Hybrid Systems Using Bisimulations - Lafferriere, Pappas, Sastry (1998)
(Correct)
6.1%: Subanalytic Stratifications and Bisimulations - Lafferriere, Pappas, Sastry (1998)
(Correct)
Active bibliography (related documents): More All
0.2: Complements of Subanalytic Sets and Existential Formulas for.. - Gabrielov (1995)
(Correct)
0.2: Schwarz Reflection Principle In Complex Spaces Of Dimension Two - Huang (1996)
(Correct)
0.2: Differential Equations Over Polynomially Bounded.. - Lion, Miller..
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.9: Decidable Hybrid Systems - Lafferriere, Pappas, Yovine (1998)
(Correct)
0.7: A New Class Of Decidable Hybrid Systems - Lafferriere, Pappas, Yovine (1999)
(Correct)
0.6: Reachability Computation For Linear Hybrid Systems - Lafferriere, Pappas, Yovine (1998)
(Correct)
Related documents from co-citation: More All
14: volume 999 of Lecture Notes in Computer Science (context) - Antsaklis, Kohn et al. - 1995
10: volume 1102 of Lecture Notes in Computer Science (context) - Alur, Henzinger et al. - 1996
9: Hierarchically consistent control systems
- Pappas, Lafferriere et al. - 1998
BibTeX entry: (Update)
G. Lafferriere, G.J. Pappas, and S. Sastry. Hybrid systems with finite bisimulations. Technical Report UCB/ERL M98/15, University of California at Berkeley, Berkeley, CA, April 1998. http://citeseer.ist.psu.edu/lafferriere99hybrid.html More
@article{ lafferriere99hybrid,
author = "Gerardo Lafferriere and George J. Pappas and Shankar Sastry",
title = "Hybrid Systems with Finite Bisimulations",
journal = "Lecture Notes in Computer Science",
volume = "1567",
pages = "186--203",
year = "1999",
url = "citeseer.ist.psu.edu/lafferriere99hybrid.html" }
Citations (may not include all citations):
666
Theoretical Computer Science (context) - Alur, Dill et al. - 1994
399
The algorithmic analysis of hybrid systems
- Alur, Coucoubetis et al. - 1995
229
A decision method for elementary algebra and geometry (context) - Tarski - 1951
168
What's decidable about hybrid automata
- Henzinger, Kopke et al. - 1995
58
Decidability of hybrid systems with rectangular di#erential ..
- Puri, Varaiya - 1994
58
Hybrid automata with finite bisimulations
- Henzinger - 1995
56
Lecture Notes in Computer Science (context) - Maler, Hybrid et al. - 1997
51
Hierarchically consistent control systems
- Pappas, La et al. - 1998
38
Lecture Notes in Computer Science (context) - Alur, Henzinger et al. - 1996
38
Lecture Notes in Computer Science (context) - Grossman, Nerode et al. - 1993
38
A shorter model theory (context) - Hodges - 1997
35
Lecture Notes in Computer Science (context) - Antsaklis, Kohn et al. - 1995
35
Lecture Notes in Computer Science (context) - Antsaklis, Kohn et al. - 1997
33
Logic and structure (context) - van Dalen - 1994
30
Model completeness results for expansions of the ordered fie.. (context) - Wilkie - 1996
22
Subanalytic sets and feedback control (context) - Sussmann - 1979
18
The hierarchical lattices of a finite state machine (context) - Caines, Wei - 1995
16
Deciding reachability for planar multi-polynomial systems
- Cerans, Viksna - 1996
8
Subanalytic sets (context) - Hironaka - 1973
8
A general theorem of the complement and some new o-minimal s.. (context) - Wilkie - 1997
8
the real exponential field with restricted analytic function.. (context) - van den Dries, Miller - 1994
4
Hautes Etudes Sci (context) - Bierstone, Milman et al. - 1988
2
Transactions of the American Mathematical Society (context) - desingularization, sets et al. - 1990
1
Lecture Notes in Computer Science (context) - La, Pappas et al. - 1998
1
IEEE Transactions on Automatic Control : Special Issue on Hy.. (context) - control, theoretic - 1998
1
Kreiseliana: About and around Georg Kreisel (context) - Macintyre, Wilkie et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.seas.upenn.edu/~pappasg/publications.html): More
Accurate Event Detection for Simulating Hybrid Systems - Esposito, Kumar, Pappas (2001)
(Correct)
Composing Abstractions of Hybrid Systems - Tabuada, Pappas, Lima (2002)
(Correct)
Consistent Abstractions of Affine Control Systems - Pappas, Simic (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC