Firing rate optimization of cyclic timed event graphs by token allocations

DOI10.1016/S0005-1098(01)00189-3zbMath1015.93034MaRDI QIDQ5953543

Carla Seatzu, Alessandro Giua, Aldo Piccaluga

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

mixed integer linear programming; cyclic timed event graph; token allocation

Mathematics Subject Classification ID

90C11: Mixed integer programming

93C65: Discrete event control/observation systems

Related Items

Optimal Supervisory Control of Discrete Event Systems: Cyclicity and Interleaving of Tasks, Complexity results for weighted timed event graphs, Minimizing place capacities of weighted event graphs for enforcing liveness, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Performance evaluation of concurrent systems using Petri nets
• Optimization of kanban-based manufacturing systems
• Marked directed graphs
• Performance evaluation of job-shop systems using timed event-graphs
• Performance evaluation of marked graphs by linear programming
• Optimisation of invariant criteria for event graphs
• Properties and performance bounds for timed marked graphs
• On some LP problems for performance evaluation of timed marked graphs