Enforcing Periodic Transition Deadlines in Time Petri Nets With Net Unfoldings

摘要

We define a method for the automatic generation of supervisory controllers that force a plant to perform a given operation by a given deadline. The operation must be executed by a prespecified delay $lambda$ with respect to the previous execution of the operation. Although our supervisor generation occurs offline with respect to plant execution, the resulting controllers automatically take into account variable task durations in an effort to increase the flexibility of operation schedules in the controlled plant. We model both the controlled plant and control supervisors as time Petri nets. In this setting, our control supervisors must force a target transition $t_{d}$ to fire within $lambda$ time units since the previous firing of $t_{d}$. Our supervisor generation is based on the concept of a transition latency. The latency of a Petri net transition $t$ is the time interval during which $t$ must be disabled in order for target transition $t_{d}$ to fire by its deadline. If a transition $t$ that may delay the firing of $t_{d}$ has latency $l(t)$, then $t$ must be disabled at least $l(t)$ time units before the expiration of the deadline on $t_{d}$. In this paper, we discuss in detail two algorithms for generating transition latencies, and we show an application to a maintenance system.