Advertisement

Discrete Event Dynamic Systems

, Volume 23, Issue 2, pp 197–209 | Cite as

Scheduling and control of real-time systems based on a token player approach

  • Patrice Bonhomme
Article

Abstract

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.

Keywords

Scheduling Control Discrete events systems Performances evaluation Real-time systems Time Petri nets 

References

  1. Berthomieu B, Diaz M (1991) Modeling and verification of time dependent systems using time Petri nets. IEEE Trans Softw Eng 17:259–273MathSciNetCrossRefGoogle Scholar
  2. Boucheneb H, Berthelot G (1993) Towards a simplified building of time Petri nets reachability graph. In: Proc PNPM’93, pp 46–55Google Scholar
  3. Freedman P (1991) Time, Petri nets, and robotics. IEEE Trans Robot Autom 7(4):417–433CrossRefGoogle Scholar
  4. 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
  5. Merlin P, Farber D (1976) Recoverability of communication protocols—implications of a theoretical study. IEEE Trans Commun 24:1036–1043MathSciNetMATHCrossRefGoogle Scholar
  6. Murata T (1989) Petri nets: properties, analysis and applications. Proc IEEE 77(4):541–580CrossRefGoogle Scholar
  7. Sathaye AS, Krogh GH (1998) Supervisor synthesis for real-time discrete event systems. Discrete Event Dyn Syst 8(1):5–35MathSciNetMATHCrossRefGoogle Scholar
  8. 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

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.Laboratoire d’Informatique (EA 2101)University François Rabelais, Equipe Ordonnancement et Conduite (ERL CNRS 6305)ToursFrance

Personalised recommendations