In this paper, we show that if a system with conflicts is modeled using an extended class of TEGs: Conflicting Timed Event Graphs (CTEGs), it is quite possible ...

Timed Event Graphs (TEGs) are a specific class of Petri nets that have been thoroughly studied given their useful linear state representation in (Max,+) ...

Sep 3, 2010 · In this paper, we show that if a system with conflicts is modeled using an extended class of TEGs: Conflicting Timed. Event Graphs (CTEGs), then ...

Linear Time-Varying (Max,+) Representation of Conflicting Timed Event Graphs. Published on 30 August 2010 - 10th IFAC Workshop on Discrete Event Systems.

More precisely, we prove that the evolution of a NCTEG satisfies linear time-varying (Max,+) equations. In case of cyclic NCTEGs, which are a natural model of ...

Jul 3, 2020 · Timed event graphs (TEGs) are a subclass of timed Petri nets that model synchronization and delay phenomena, but not conflict or choice.

Networked conflicting timed event graphs representation in (Max,+) algebra ... Linear time-varying (max, +) representation of conflicting timed event graphs.

Addad et al. (2012) proves that network conflicting timed event graphs can be represented by linear time-varying equations in the max-plus ...

Jul 12, 2023 · In this chapter, we are going to tackle the control of a particular class of Discreet Event systems, which is the subclass of Conflicted Timed Event Graphs ...

This note proposes an internal model control for linear discrete-event systems over max-algebra. We concentrate on the controller block of this control ...