scientific article; zbMATH DE number 4092766

From MaRDI portal
Publication:3820002





[For the entire collection see Zbl 0658.00014.] 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 cal 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 page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3820002)