Title :
Asymptotic throughput of continuous timed Petri nets
Author :
Ohen, Guyc ; Aubert, Stephaneg ; Quadrat, J.-P.
Author_Institution :
Centre Autom. et Syst., Ecole des Mines de Paris, Fontainebleau, France
Abstract :
We set up a connection between continuous timed Petri nets (the fluid version of usual timed Petri nets) and Markov decision processes. We characterize the subclass of continuous timed Petri nets corresponding to undiscounted average cost structure. This subclass satisfies conservation laws and shows a linear growth: one obtains as mere application of existing results for dynamic programming the existence of an asymptotic throughput. This rate can be computed using Howard type algorithms, or by an extension of the well known cycle time formula for timed event graphs. We present an illustrating example and briefly sketch the relation with the discrete case
Keywords :
Markov processes; Petri nets; decision theory; discrete event simulation; discrete event systems; dynamic programming; Howard type algorithms; Markov decision processes; Max plus algebra; asymptotic throughput; conservation laws; continuous timed Petri nets; cycle time formula; discrete case; discrete event systems; dynamic programming; fluid version; linear growth; timed event graphs; undiscounted average cost structure; Algebra; Costs; Discrete event systems; Equations; Linear systems; Petri nets; Polynomials; Raw materials; Routing; Throughput;
Conference_Titel :
Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
Conference_Location :
New Orleans, LA
Print_ISBN :
0-7803-2685-7
DOI :
10.1109/CDC.1995.480646