Asymptotic throughput of continuous timed Petri nets

Guy Cohen, Stephane Gaubert, Jean Pierre Quadrat

Research output: Contribution to journalConference articlepeer-review

27 Scopus citations

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.

Original languageEnglish
Pages (from-to)2029-2034
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume2
StatePublished - 1 Dec 1995
Externally publishedYes
EventProceedings of the 1995 34th IEEE Conference on Decision and Control. Part 1 (of 4) - New Orleans, LA, USA
Duration: 13 Dec 199515 Dec 1995

Fingerprint

Dive into the research topics of 'Asymptotic throughput of continuous timed Petri nets'. Together they form a unique fingerprint.

Cite this