Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T11:53:45.391Z Has data issue: false hasContentIssue false

Formal language propertiesof hybrid systems with strong resets

Published online by Cambridge University Press:  11 February 2010

Thomas Brihaye
Affiliation:
Institute of Mathematics, University of Mons 20, Place du Parc, 7000 Mons, Belgium; thomas.brihaye@umons.ac.be
Véronique Bruyère
Affiliation:
Institute of Computer Science, University of Mons 20, Place du Parc, 7000 Mons, Belgium; veronique.bruyere@umh.ac.be
Elaine Render
Affiliation:
School of Mathematics, University of Manchester, Oxford Road, Manchester, U.K.; e.render@maths.man.ac.uk
Get access

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.

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable