A sufficient condition for the liveness of weighted event graphs

DOI10.1016/J.EJOR.2008.07.037zbMath1159.90498OpenAlexW2041935783MaRDI QIDQ1014950

Alix Munier Kordon, Olivier Marchetti

Publication date: 30 April 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.07.037

zbMATH Keywords

livenessPetri netsweighted event graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

Liveness enforcing supervisory policies tolerant to controllability failures for discrete-event systems modeled by Petri nets ⋮ Complexity results for weighted timed event graphs ⋮ Modelling deadlock in open restricted queueing networks ⋮ On the Reversibility of Well-Behaved Weighted Choice-Free Systems ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ A sufficient condition for the liveness of weighted event graphs ⋮ Minimizing place capacities of weighted event graphs for enforcing liveness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sufficient condition for the liveness of weighted event graphs
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• A study of the cyclic scheduling problem on parallel processors
• Marking optimization of weighted marked graphs
• A genetic approach to solving the problem of cyclic job shop scheduling with linear 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
• Termination Properties of Generalized Petri Nets
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing

This page was built for publication: A sufficient condition for the liveness of weighted event graphs