Skip to main content
SpringerLink
Log in

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

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Berthomieu B, Diaz M (1991) Modeling and verification of time dependent systems using time Petri nets. IEEE Trans Softw Eng 17:259–273

    Article  MathSciNet  Google Scholar 

  • Boucheneb H, Berthelot G (1993) Towards a simplified building of time Petri nets reachability graph. In: Proc PNPM’93, pp 46–55

  • Freedman P (1991) Time, Petri nets, and robotics. IEEE Trans Robot Autom 7(4):417–433

    Article  Google 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–102

  • Merlin P, Farber D (1976) Recoverability of communication protocols—implications of a theoretical study. IEEE Trans Commun 24:1036–1043

    Article  MathSciNet  MATH  Google Scholar 

  • Murata T (1989) Petri nets: properties, analysis and applications. Proc IEEE 77(4):541–580

    Article  Google Scholar 

  • Sathaye AS, Krogh GH (1998) Supervisor synthesis for real-time discrete event systems. Discrete Event Dyn Syst 8(1):5–35

    Article  MathSciNet  MATH  Google 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–611

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique (EA 2101), University François Rabelais, Equipe Ordonnancement et Conduite (ERL CNRS 6305), 64 avenue Jean Portalis, 37200, Tours, France

    Patrice Bonhomme

Authors
  1. Patrice Bonhomme
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patrice Bonhomme.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bonhomme, P. Scheduling and control of real-time systems based on a token player approach. Discrete Event Dyn Syst 23, 197–209 (2013). https://doi.org/10.1007/s10626-012-0140-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-012-0140-4

Keywords

Search

Navigation