The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
On simulations and bisimulations of general flow systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Solutions to hybrid inclusions via set and graphical convergence with stability theory applications
Automatica (Journal of IFAC)
Crossing the bridge between similar games
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Pre-orders for reasoning about stability properties with respect to input of hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
We develop several generalized Skorokhod pseudo-metrics for hybrid path spaces, cast in a quite general setting, where the basic open sets are epsilon-tubes around paths that, intuitively, allow for some "wiggle room" in both time and space via set-valued retiming maps between the time domains of paths. We then determine necessary and sufficient conditions under which these topologies are Hausdorff and their distance functions are metrics. On spaces of paths with closed time domains, our metric topology of generalized Skorokhod uniform convergence on finite prefixes is equivalent to the implicit topology of graphical convergence of hybrid paths, currently used extensively by Teel and co-workers.