Local control law for live and bounded timed continuous Petri nets

This work is concerned with the problem of driving a live and bounded Timed Continuous Petri Net (TCPN) from an initial state to a target ending state, and remaining on it, using only local information of the transitions. It is assumed that the TCPN is under the infinite server semantics and all the transitions are controllable. The proposed control law allows to start at any reachable initial marking (even at the boundaries of the reachability set), and ending at any reachable marking at the interior of the reachability set. The proposed control is a local one, thus the required information to allow the firing of an enabled transition depends only on its input and output places. In large TCPN this control law is suitable because it is not necessary to compute large amounts of information.