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