Constraints graph based approach for the control of time critical systems

Petri nets are a powerful formalism for the specification and verification of concurrent systems including sequential systems and manufacturing systems. To deal with systems whose time issues become fundamental, different time Petri nets extensions have been developed in the literature, each one being dependent on the application considered. For the time critical systems their correctness depends not only on the logic correctness but also on the time constraints. In this paper, a new enumerative and control technique for P-time Petri nets is proposed. It is based on the firing instant notion and a graph constraints theoretic approach.