The Just-in-Time control of Timed Event Graphs with Multipliers in dioids

Abstract

Timed event graphs with multipliers, also called timed weighted marked graphs, constitute a subclass of Petri nets well adapted to model discrete event systems involving synchronization and saturation phenomena. Their dynamic behaviors can be modeled by using a particular algebra, called dioid, defined on a set of operators and endowed with the pointwise minimum operation as addition and the composition operation as multiplication. A just in time control method of these graphs based on Residuation theory is proposed.