Minimizing place capacities of weighted event graphs for enforcing liveness
From MaRDI portal
(Redirected from Publication:1020558)
Recommendations
Cites work
- A sufficient condition for the liveness of weighted event graphs
- Firing rate optimization of cyclic timed event graphs by token allocations
- scientific article; zbMATH DE number 522844 (Why is no real title available?)
- Marking optimization of weighted marked graphs
- Optimisation of invariant criteria for event graphs
- Performance evaluation of job-shop systems using timed event-graphs
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
- The basic cyclic scheduling problem with linear precedence constraints
Cited in
(4)
This page was built for publication: Minimizing place capacities of weighted event graphs for enforcing liveness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1020558)