scientific article; zbMATH DE number 4092766

zbMATH Open0667.68051MaRDI QIDQ3820002FDOQ3820002

Authors Jacques Carlier, Philippe Chrétienne 

Publication date 1988

zbMATH Keywords

polynomial algorithmbounded Petri netstimed Petri net schedules

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Extreme runtimes of schedules modelled by time Petri nets
• scientific article; zbMATH DE number 4074795
• A causal semantic for time Petri nets
• Timed Petri nets in modeling and analysis of simple schedules for manufacturing cells
• scientific article; zbMATH DE number 3896317

Cited in

(22)

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

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)