Formal language properties of hybrid systems with strong resets
Institute of Mathematics,
University of Mons 20, Place du Parc,
7000 Mons, Belgium; firstname.lastname@example.org
2 Institute of Computer Science, University of Mons 20, Place du Parc, 7000 Mons, Belgium; email@example.com
3 School of Mathematics, University of Manchester, Oxford Road, Manchester, U.K.; firstname.lastname@example.org
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.
Mathematics Subject Classification: 68Q68 / 68Q45
Key words: Hybrid systems with strong resets / formal language theory.
© EDP Sciences, 2010