The non-blocking forbidden state problem for compact rectangular hybrid automata

The problem of supervisory control for compact rectangular hybrid automata is considered. The supervisor can disable only discrete event transitions in order to solve a non-blocking forbidden state problem. The non-blocking problem is defined under both strong and weak conditions. For the latter maximally permissive solutions that are computable are derived.