Abstract

A novel framework is introduced for the supervisory control (SC) of timed discrete event systems based on Time Petri nets. The method encompasses both logical (markings to reach or avoid) and temporal specifications (arrival and departure times in specific markings). It relies on the construction of a partial forward reachability graph of the modified state class graph type and the formulation of integer linear programming problems to establish suitable firing time intervals (FTIs) for the controllable transitions. For each enabled controllable transition, the SC algorithm provides the largest FTI that that the specifications are met, irrespectively of the firing times of the uncontrollable transitions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call