Article contents
Formal language properties of hybrid systems with strong resets
Published online by Cambridge University Press: 11 February 2010
Abstract
We study hybrid systems with strong resets from the perspective of formal language theory. We define a notion of hybrid regular expression and prove a Kleene-like theorem for hybrid systems. We also prove the closure of these systems under determinisation and complementation. Finally, we prove that the reachability problem is undecidable for synchronized products of hybrid systems.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2010
References
- 2
- Cited by