Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Formal language properties of hybrid systems with strong resets

Thomas BrihayeVéronique BruyèreElaine Render — 2010

RAIRO - Theoretical Informatics and Applications

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.

Page 1

Download Results (CSV)