Minimizing Place Capacities of Weighted Event Graphs for Enforcing Liveness
Résumé
This paper addresses the problem of minimizing place capacities of weighted event graphs in order to enforce liveness. Necessary and sufficient conditions of the solution existence are derived. Lower bounds of place capacities while preserving liveness are established and a polynomial algorithm is proposed to determine an initial marking leading to these lower bounds while preserving the liveness.