Cycle time of a P-time event graph with affine-interdependent residence durations

DOI10.1007/s10626-013-0173-3zbMath1302.93145OpenAlexW2022443649MaRDI QIDQ481356

Philippe Declerck

Publication date: 12 December 2014

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-013-0173-3

zbMATH Keywords

linear programmingcycle time\(P\)-time Petri nets

Mathematics Subject Classification ID

Linear programming (90C05) Discrete event control/observation systems (93C65) Applications of graph theory to circuits and networks (94C15)

Related Items (2)

Critical subsystems in time interval models. Application to a baking process ⋮ Analysis of P-time event graphs in (max,+) and (min,+) semirings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Performance evaluation of concurrent systems using Petri nets
• A characterization of the minimum cycle mean in a digraph
• Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
• Properties and performance bounds for timed marked graphs
• Discrete Event Systems in Dioid Algebra and Conventional Algebra
• From Extremal Trajectories to Token Deaths in P-time Event Graphs

This page was built for publication: Cycle time of a P-time event graph with affine-interdependent residence durations