Supervisory control for rectangular hybrid automata

We consider the problem of supervisory control for compact rectangular automata with uniform rectangular activity, i.e. initialised. The supervisory controller is state feedback and can disable only discrete-event transitions in order to solve the 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 on a finite quotient space characterised by language equivalence are derived