Pages that link to "Item:Q513811"

The following pages link to Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra (Q513811):

Displaying 11 items.

• Networked conflicting timed event graphs representation in (Max,+) algebra (Q351734) (← links)
• Cycle time of a P-time event graph with affine-interdependent residence durations (Q481356) (← links)
• Time separations of cyclic event rule systems with min-max timing constraints (Q955027) (← links)
• Performance evaluation of concurrent systems using conflict-free and persistent Petri nets (Q1108799) (← links)
• Performance safety enforcement in strongly connected timed event graphs (Q2021327) (← links)
• Steady state analysis of timed event graphs with time window constraints (Q2440115) (← links)
• Algebraic approaches for designing control laws of time-constrained networked conflicting timed event graphs (Q2676095) (← links)
• Analysis of P-time event graphs in (max,+) and (min,+) semirings (Q5028000) (← links)
• Modelling and feedback control for a class of Petri Nets with shared resources subject to strict time constraints using Max-plus algebra (Q5029166) (← links)
• An algebraic model for performance evaluation of timed event multigraphs (Q5266800) (← links)
• (Q5753732) (← links)