Skip to main content
SpringerLink
Log in

Timed Petri Net schedules

  • Conference paper
  • First Online:
Advances in Petri Nets 1988 (APN 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 340))

Included in the following conference series:

Abstract

In this paper, we define Timed Petri Net schedules and study some of their properties. We prove that the set of schedules issued from a firable sequence of the underlying Petri net has a minimum element we call earliest schedule of the sequence. We then propose a polynomial algorithm to compute it. In order to study earliest schedules, we introduce next a graph we call earliest state graph. Finally, for bounded Petri nets, we prove that earliest schedules issued from periodic infinite sequences are K-periodic and constitute a dominant subset.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

VIII. References

  1. C.ANDRE, G.BERTHELOT, C.GIRAULT, G.MEMMI, G.ROUCAIROL, G.SIFAKIS, R.VALETTE, G.VIDAL NAQUET Réseaux de Petri, Tomes 1 et 2. MASSON, 1982.

    Google Scholar 

  2. J.CARLIER, P.CHRETIENNE, C.GIRAULT Modelling scheduling problems with Timed Petri Nets. Advances in Petri Nets 1985.

    Google Scholar 

  3. J. CARLIER, P. CHRETIENNE Un domaine très ouvert: les problèmes d'ordonnancement. RAIRO, 16,3,p175–217; 1982

    Google Scholar 

  4. J.CARLIER Problèmes d'ordonnancement à contraintes de ressources: algorithmes et complexité Thèse d'état, Université Paris VI; 1984

    Google Scholar 

  5. P.CHRETIENNE Les réseaux de Petri temporisés Thèse d'état, Université Paris VI, mai 1983

    Google Scholar 

  6. P. CHRETIENNE Exécutions contrôlées des réseaux de Petri temporisés TSI,1,p23–31; 1984

    Google Scholar 

  7. G.COHEN, D.DUBOIS, J.P. QUADRAT, M.VIOT A linear system theoretic view of discrete event processes and its use for performance evaluation in manufacturing. IEEE Trans on Automatic Control, March 85; 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Technologique de Compiegne, France

    J. Carlier

  2. Laboratoire MASI, Université Pierre et Marie Curie, Aile 56-66, bureau 116 4, place JUSSIEU, 75252, Paris Cedex 05

    P. Chretienne

Authors
  1. J. Carlier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Chretienne
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carlier, J., Chretienne, P. (1988). Timed Petri Net schedules. In: Rozenberg, G. (eds) Advances in Petri Nets 1988. APN 1987. Lecture Notes in Computer Science, vol 340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50580-6_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-50580-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50580-8

  • Online ISBN: 978-3-540-46059-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation