Formal language properties of hybrid systems with strong resets
Thomas Brihaye, Véronique Bruyère, Elaine Render · RAIRO - Theoretical Informatics and Applications · 2010
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.