Minimizing place capacities of weighted event graphs for enforcing liveness

DOI10.1007/S10626-007-0035-YzbMath1161.93321OpenAlexW2121047210MaRDI QIDQ1020558

Olivier Marchetti, Alix Munier Kordon

Publication date: 29 May 2009

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-007-0035-y

zbMATH Keywords

manufacturinglivenessPetri netsbuffer requirement

Mathematics Subject Classification ID

Multivariable systems, multidimensional control systems (93C35) Discrete event control/observation systems (93C65)

Related Items (1)

Complexity results for weighted timed event graphs

Cites Work

• Unnamed Item
• A sufficient condition for the liveness of weighted event graphs
• Marking optimization of weighted marked graphs
• The basic cyclic scheduling problem with linear precedence constraints
• Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing
• Performance evaluation of job-shop systems using timed event-graphs
• Optimisation of invariant criteria for event graphs
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• Firing rate optimization of cyclic timed event graphs by token allocations

This page was built for publication: Minimizing place capacities of weighted event graphs for enforcing liveness