Firing rate optimization of cyclic timed event graphs by token allocations

DOI10.1016/S0005-1098(01)00189-3zbMath1015.93034OpenAlexW2093459171MaRDI 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 programmingcyclic timed event graphtoken allocation

Mathematics Subject Classification ID

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

Related Items (6)

Performance safety enforcement in stochastic event graphs against boost and slow attacks ⋮ Complexity results for weighted timed event graphs ⋮ Performance safety enforcement in strongly connected timed event graphs ⋮ An improved approach for marking optimization of timed weighted marked graphs ⋮ Minimizing place capacities of weighted event graphs for enforcing liveness ⋮ Optimal Supervisory Control of Discrete Event Systems: Cyclicity and Interleaving of Tasks

Cites Work

• 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
• Unnamed Item
• Unnamed Item

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