scientific article; zbMATH DE number 4092766
[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.
- Periodic schedules for linear precedence constraints
- Dynamic sequencing of robot moves in a manufactoring cell
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- Using timed Petri net to model instruction-level loop scheduling with resource constraints
- Petri nets for the design and operation of manufacturing systems
- Off-line computation of real-time schedules using Petri nets
- Periodic scheduling of marked graphs using balanced binary words
- Analysis of discrete event systems by simulation of timed Petri net models
- Timed Petri nets with reset for pipelined synchronous circuit design
- Extremal throughputs in free-choice nets
- Scheduling analysis of FMS: an unfolding timed Petri nets approach
- Solving transient scheduling problems with constraint programming
- Petri net based scheduling
- Realizability of schedules by stochastic time Petri nets with blocking semantics
- scientific article; zbMATH DE number 1751909 (Why is no real title available?)
- Cyclic scheduling for the synthesis of embedded systems
- scientific article; zbMATH DE number 1836381 (Why is no real title available?)
- Analysis of P-time event graphs in (max,+) and (min,+) semirings
- Extreme runtimes of schedules modelled by time Petri nets
- Asymptotic behavior in a heap model with two pieces
- Timed Petri nets and temporal linear logic
- The basic cyclic scheduling problem with deadlines
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)