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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
VIII. References
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.
J.CARLIER, P.CHRETIENNE, C.GIRAULT Modelling scheduling problems with Timed Petri Nets. Advances in Petri Nets 1985.
J. CARLIER, P. CHRETIENNE Un domaine très ouvert: les problèmes d'ordonnancement. RAIRO, 16,3,p175–217; 1982
J.CARLIER Problèmes d'ordonnancement à contraintes de ressources: algorithmes et complexité Thèse d'état, Université Paris VI; 1984
P.CHRETIENNE Les réseaux de Petri temporisés Thèse d'état, Université Paris VI, mai 1983
P. CHRETIENNE Exécutions contrôlées des réseaux de Petri temporisés TSI,1,p23–31; 1984
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
Author information
Authors and Affiliations
Editor information
Rights 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