Linear Time-Varying (Max,+) Representation of Conflicting Timed Event Graphs

Abstract : 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 an extended class of TEGs: Conflicting Timed Event Graphs (CTEGs), then it is quite possible to obtain an equivalent (Max,+) representation. More precisely, we prove that the evolution of a CTEG satisfies linear time-varying (Max,+) equations. In case of cyclic CTEGs, which are a natural model of many repetitive systems, we provide a standard time-invariant (Max,+) representation. Finally, a practical example (a Jobshop) is used for illustration to exhibit the interest of this investigation.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger
Contributeur : Boussad Addad <>
Soumis le : vendredi 3 septembre 2010 - 16:11:46
Dernière modification le : jeudi 9 février 2017 - 15:56:19
Document(s) archivé(s) le : samedi 4 décembre 2010 - 02:53:10


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00514901, version 1



Boussad Addad, Saïd Amari, Jean-Jacques Lesage. Linear Time-Varying (Max,+) Representation of Conflicting Timed Event Graphs. 10th Int Workshop on Discrete Event Systems, Aug 2010, Berlin, Germany. pp.310-315. ⟨hal-00514901⟩



Consultations de la notice


Téléchargements de fichiers