Minimizing Place Capacities of Weighted Event Graphs for Enforcing Liveness

Authors:
Olivier Marchetti;Alix Munier-Kordon
Affiliations:
Laboratoire d'Informatique de Paris 6---Département SoC, Université Pierre et Marie Curie, Paris Cedex 05, France 75252;Laboratoire d'Informatique de Paris 6---Département SoC, Université Pierre et Marie Curie, Paris Cedex 05, France 75252
Venue:
Discrete Event Dynamic Systems
Year:
2008

Citing 9
Cited 1

Static scheduling of synchronous data flow programs for digital signal processing

IEEE Transactions on Computers
The basic cyclic scheduling problem with linear precedence constraints

Discrete Applied Mathematics
Joint Minimization of Code and Data for Synchronous DataflowPrograms

Formal Methods in System Design
Synthesis of Embedded Software from Synchronous Dataflow Specifications

Journal of VLSI Signal Processing Systems
Minimal Memory Schedules for Dataflow Networks

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On Weighted T-Systems

Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Liveness of Weighted Circuits and the Diophantine Problem of Frobenius

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Marking Optimization of Weighted Marked Graphs

Discrete Event Dynamic Systems
Firing rate optimization of cyclic timed event graphs by token allocations

Automatica (Journal of IFAC)

Complexity results for Weighted Timed Event Graphs

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.