Name
Abstract | ||
|---|---|---|
In this paper, we consider the control of general hybrid systems. In this context we show that time-abstract bisimulation is not adequate for solving such a problem. That is why we consider an other equivalence, namely the suffix equivalence based on the encoding of trajectories through words. We show that this suffix equivalence is in general a correct abstraction for control problems. We apply this result to o-minimal hybrid systems, and get decidability and computability results in this framework. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/LICS.2006.22 | Seattle, WA |
Keywords | Field | DocType |
bisimulation equivalence,computability,computational complexity,control theory,decidability,finite state machines,computability,decidability,o-minimal hybrid systems,suffix equivalence,time-abstract bisimulation,trajectory encoding | Discrete mathematics,Combinatorics,Suffix,Computer science,Finite-state machine,Computability,Decidability,Equivalence (measure theory),Bisimulation,Hybrid system,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1043-6871 | 0-7695-2631-4 | 11 |
PageRank | References | Authors |
0.58 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patricia Bouyer | 1 | 435 | 29.20 |
| Thomas Brihaye | 2 | 460 | 35.91 |
| Fabrice Chevalier | 3 | 126 | 7.32 |