Firing rate optimization of cyclic timed event graphs by token allocations

DOI10.1016/S0005-1098(01)00189-3MaRDI QIDQ5953543zbMATH OpenOpenAlexFDO

Authors Alessandro Giua, Aldo Piccaluga, C. Seatzu

Publication date 13 July 2003

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0005-1098(01)00189-3

zbMATH Keywords

cyclic timed event graphmixed integer linear programmingtoken allocation

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete event control/observation systems (93C65)

Review text

The authors consider the problem of allocating a given number of tokens in a cyclic timed event graph so as to maximize the firing rate of the net. They propose three different approaches. The first one is an efficient heuristic. The other two involve the solution of a mixed integer linear programming problem. A job-shop problem is used to demonstrate the applicability of the results.

Recommendations

• scientific article; zbMATH DE number 1836370
• Marking optimization of stochastic timed event graphs using IPA
• Resource optimization and (min,+) spectral theory
• Some optimization problems for timed marked graphs
• scientific article; zbMATH DE number 1070400

Cites work

• scientific article; zbMATH DE number 3694917 (Why is no real title available?)
• scientific article; zbMATH DE number 1836370 (Why is no real title available?)
• Marked directed graphs
• On some LP problems for performance evaluation of timed marked graphs
• Optimisation of invariant criteria for event graphs
• Optimization of kanban-based manufacturing systems
• Performance evaluation of concurrent systems using Petri nets
• Performance evaluation of job-shop systems using timed event-graphs
• Performance evaluation of marked graphs by linear programming
• Properties and performance bounds for timed marked graphs

Cited in

(10)

• Minimizing place capacities of weighted event graphs for enforcing liveness
• Models for parameter optimization of Timed Token Rotation Protocols
• Performance safety enforcement in strongly connected timed event graphs
• An improved approach for marking optimization of timed weighted marked graphs
• Performance safety enforcement in stochastic event graphs against boost and slow attacks
• Optimisation of invariant criteria for event graphs
• Complexity results for weighted timed event graphs
• scientific article; zbMATH DE number 1836370 (Why is no real title available?)
• Optimal supervisory control of discrete event systems: cyclicity and interleaving of tasks
• A survey on performance evaluations in time-dependent Petri nets

This page was built for publication: Firing rate optimization of cyclic timed event graphs by token allocations

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