@inproceedings{10.1007/3-540-61604-7_74,
author = {Thomas A. Henzinger and Peter W. Kopke},
doi = {https://dx.doi.org/10.1007/3-540-61604-7_74},
abstract = {Three natural equivalence relations on the infinite state space of a hybrid automaton are language equivalence, simulation equivalence, and bisimulation equivalence. When one of these equivalence relations has a finite quotient, certain model checking and controller synthesis problems are decidable. When bounds on the number of equivalence classes are obtained, bounds on the running times of model checking and synthesis algorithms follow as corollaries.},
address = {Berlin, Heidelberg},
booktitle = {CONCUR '96: Concurrency Theory},
editor = {Montanari, Ugo and Sassone, Vladimiro},
file = {State equivalences for rectangular hybrid automata - Henzinger-Kopke1996\_Chapter\_StateEquivalencesForRectangula - b.pdf},
isbn = {978-3-540-70625-0},
pages = {530--545},
publisher = {Springer Berlin Heidelberg},
title = {{State equivalences for rectangular hybrid automata}},
year = {1996},
date-added = {2021-04-29 11:14:35 +0200},
date-modified = {2026-1-15 9:50:13 +0100}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A