Pages that link to "Item:Q351734"

The following pages link to Networked conflicting timed event graphs representation in (Max,+) algebra (Q351734):

Displaying 11 items.

• Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra (Q513811) (← links)
• Failure detection and localization for timed event graphs in \((\max,+)\)-algebra (Q2063096) (← links)
• Analysis and control of max-plus linear discrete-event systems: an introduction (Q2177779) (← links)
• Design of control laws for timed event graphs networks subject to mutual exclusion constraints in min-plus algebra (Q2667519) (← 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)
• Performance evaluation of nonlinear weighted T-system (Q5172485) (← links)
• An algebraic model for performance evaluation of timed event multigraphs (Q5266800) (← links)
• (Q5753732) (← links)
• Modeling and control of drug assignment for pharmaceutical cabinets using discrete event systems approaches (Q6583368) (← links)