Scheduling and control of real-time systems based on a token player approach
- 233 Downloads
Petri nets are a powerful formalism for the specification and verification of concurrent systems, such as sequential systems and manufacturing systems. To deal with real-time systems whose time issues become essential, different extensions of Petri nets with time have been proposed in the literature. In this paper, a new scheduling and control technique for real-time systems modeled by ordinary P-time Petri nets is proposed. Its goal is to provide a scheduling for a particular firing sequence, without any violation of timing constraints ensuring that no deadline is missed. It is based on the firing instant notion and it consists in determining an inequality system generated for a possible evolution (in terms of a feasible firing sequence for the untimed underlying Petri net) of the model. This system can be used to check reachability problems as well as evaluating the performances of the model considered and determining the associated control for a definite functioning mode and it introduces partial order on the execution of particular events.
KeywordsScheduling Control Discrete events systems Performances evaluation Real-time systems Time Petri nets
- Boucheneb H, Berthelot G (1993) Towards a simplified building of time Petri nets reachability graph. In: Proc PNPM’93, pp 46–55Google Scholar
- Khansa W, Denat JP, Collart S (1996) P-time Petri nets for manufacturing systems. In: Proc wodes’96, Edinburgh UK, 19–21 Aug 1996, pp 94–102Google Scholar
- Wang H, Grigore L, Buy U, Darabi H (2007) Enforcing transition deadlines in time Petri nets. In: Proc the 12th IEEE conference on emerging technologies and factory automation. ETFA 2007, Greece, pp 604–611Google Scholar