Timed Event Graphs (TEGs) are a specific class of Petri nets that have been thoroughly studied given their useful linear state representation in (Max,+) algebra. Unfortunately, TEGs are generally not suitable for modeling systems displaying resources sharing (or conflicts). In this paper, we show that if a system with conflicts is modeled using a NCTEG (Networked Conflicting Timed Event Graphs), it is quite possible to obtain an equivalent (Max,+) representation. 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 many repetitive systems, we provide a standard time-invariant (Max,+) representation. As an application of the proposed approach to exhibit its interest, we consider the case of Jobshops. We first propose a generic NCTEG-based model of these systems and subsequently apply the corresponding (Max,+) representation to evaluate some of their performances.
Timed event graph (Max,+) algebra Conflict Linear-time varying systems Repetitive systems
This is a preview of subscription content, log in to check access.
Addad B, Amari S, Lesage JJ (2010) Linear time-varying (Max,+) representation of conflicting timed event graphs. In: 10th int. workshop on discrete event systems, Berlin, Germany, pp 310–315Google Scholar
Baccelli F, Cohen G, Olsder GJ, Quadrat JP (1992) Synchronization and linearity: an algebra for discrete event systems. Wiley, New YorkzbMATHGoogle Scholar
Bolzern P, Colaneri P, Scatolini R (1986) Zeros of discrete time linear periodic systems. IEEE Trans Automat Contr 31:1057–1058zbMATHCrossRefGoogle Scholar
Boutin O, Cottenceau B, L’Anton A, Loiseau JJ (2009) Modeling systems with periodic routing functions in dioid (Min,+). In: 13th IFAC symposium on information control problems in manufacturing, Moscow, Russia, pp 1377–1382Google Scholar
Cohen G, Gaubert S, Quadrat JP (1999) Max plus algebra and systems theory: where we are and where to go now. Annu Rev Control 23:207–219Google Scholar
Correia A, Abbas-Turki A, Bouyekhf R, El Moudni A (2009) A dioid model for invariant resource sharing problems. IEEE Trans Syst Man Cybern Part A Syst Humans 39(4):770–781CrossRefGoogle Scholar
Murata T (1989) Petri nets: properties analysis and applications. Proc IEEE 77(4):541–580CrossRefGoogle Scholar
Nait SM, Manier MA, El Moudni A, Wack M (2006) Petri net with conflicts and (max,plus) algebra for transportation systems. In: 11th IFAC symposium on transportation systems, The NetherlandsGoogle Scholar
Van Den Boom TJJ, De Shutter B (2006) Modeling and control of discrete event systems using switching Max-Plus linear systems. Control Eng Pract 14(10):1199–1211CrossRefGoogle Scholar