Simon Collart DUTILLEUL1, Anis M’HALLA1,2, Etienne CRAYE1, Mohamed BENREJEB2
Laboratoire d’Automatique, Génie Informatique et Signal,
Ecole Centrale de Lille
Cité Scientifique BP 48,
59651 Villeneuve d’Ascq, France
Laboratoire de Recherche en Automatique,
Ecole Nationale d’Ingénieurs de Tunis,
BP 37, le Belvédère, 1002 Tunis, Tunisie
Abstract: The presented work is dedicated to the robustness of a milk manufacturing workshop including time interval constraints. In such systems, operation times are included between a minimum and a maximum value. Weighted Marked Graphs are used for modelling. Some results proposing to transform Weighted Marked Graphs into Marked Graphs are reviewed, which allow obtaining a model that can be used to apply some robustness results of the state of the art. The main contribution of this paper is a computing algorithm of the maximal time disturbances allowed at a given point. Finally, to demonstrate the effectiveness and accuracy of the proposed algorithm, an application to a milk production unit is outlined. The possession of this exact value allows checking the death of marks on the levels of synchronization transitions of a P-time Petri net model without generating any false alarm. The results show that the difference between the exact value and the lower bound of the state of the art algorithm is quite important.
Keywords: Weighted Marked Graphs, P-time Petri nets, milk manufacturing unit, passive robustness, false alarm, time disturbance.
CITE THIS PAPER AS:
Simon Collart DUTILLEUL, Anis M’HALLA, Etienne CRAYE, Mohamed BENREJEB, Passive Robustness Computing of a Milk Manufacturing Unit with Time Constraints: Alarm Filtering Issues, Studies in Informatics and Control, ISSN 1220-1766, vol. 20 (4), pp. 393-402, 2011.