A sufficient condition for the liveness of weighted event graphs

DOI10.1016/J.EJOR.2008.07.037MaRDI QIDQ1014950zbMATH OpenOpenAlexFDO

Authors Olivier Marchetti, Alix Munier-Kordon

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)

Recommendations

• Minimizing place capacities of weighted event graphs for enforcing liveness
• Complexity results for weighted timed event graphs
• scientific article; zbMATH DE number 522844
• Marking optimization of weighted marked graphs
• Cyclic scheduling for the synthesis of embedded systems

Cites work

• A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
• A study of the cyclic scheduling problem on parallel processors
• A sufficient condition for the liveness of weighted event graphs
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3921988 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 522844 (Why is no real title available?)
• scientific article; zbMATH DE number 563124 (Why is no real title available?)
• scientific article; zbMATH DE number 4189459 (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
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• Termination Properties of Generalized Petri Nets

Cited in

(9)

• A sufficient condition for the liveness of weighted event graphs
• Minimizing place capacities of weighted event graphs for enforcing liveness
• Modelling deadlock in open restricted queueing networks
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• Liveness enforcing supervisory policies tolerant to controllability failures for discrete-event systems modeled by Petri nets
• scientific article; zbMATH DE number 522844 (Why is no real title available?)
• Complexity results for weighted timed event graphs
• On the reversibility of well-behaved weighted choice-free systems
• Max-plus algebraic description of evolutions of weighted timed event graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014950)