scholarly journals Time Disturbances and Filtering of Sensors Signals in Tolerant Multi-product Job-shops with Time Constraints

Author(s):  
Nabil Jerbi ◽  
Simon Collart Dutilleul ◽  
Etienne Craye ◽  
Mohamed Benrejeb

This paper deals with supervision in critical time manufacturing jobshops without assembling tasks. Such systems have a robustness property to deal with time disturbances. A filtering mechanism of sensors signals integrating the robustness values is proposed. It provides the avoidance of control freezing if the time disturbance is in the robustness intervals. This constitutes an enhancement of the filtering mechanism since it makes it possible to continue the production in a degraded mode providing the guarantees of quality and safety. When a symptom of abnormal functioning is claimed by the filtering mechanism, it is imperative to localize the time disturbance occurrence. Based upon controlled P-time Petri nets as a modeling tool, a series of lemmas are quoted in order to build a theory dealing with the localization problem.

Author(s):  
Anis M’halla ◽  
Nabil Jerbi ◽  
Simon Collart Dutilleul ◽  
Etienne Craye ◽  
Mohamed Benrejeb

The presented work is dedicated to the supervision of manufacturing job-shops with time constraints. Such systems have a robustness property towards time disturbances. The main contribution of this paper is a fuzzy filtering approach of sensors signals integrating the robustness values. This new approach integrates a classic filtering mechanism of sensors signals and fuzzy logic techniques. The strengths of these both techniques are taken advantage of the avoidance of control freezing and the capability of fuzzy systems to deal with imprecise information by using fuzzy rules. Finally, to demonstrate the effectiveness and accuracy of this new approach, an example is depicted. The results show that the fuzzy approach allows keeping on producing, but in a degraded mode, while providing the guarantees of quality and safety based on expert knowledge integration.


1997 ◽  
Vol 30 (6) ◽  
pp. 1487-1492 ◽  
Author(s):  
Soizick Calvez ◽  
Pascal Aygalinc ◽  
Wael Khansa

Author(s):  
Nabil Jerbi ◽  
Simon Collart-Dutilleul

This paper is dedicated to the study of constraints violation in manufacturing workshops with time constraints. In such systems, every operation duration is included between minimal and maximal values. P-time Petri nets are used for modeling. A new theorem is introduced, constituting a decision tool about the occurrence of constraints violation at the level of a synchronization transition when various types of time disturbances occur. It shows the robustness properties of a manufacturing system on a range that may include delay and advance disturbances. The theoretical result is illustrated step by step on a given workshop. Two other lemmas are elaborated contributing to the study of the constraints violation problem. The final goal is to generalize the robustness property towards simultaneous occurrence of two delays at two points of the system, each having its own robustness range.


2022 ◽  
Vol 183 (1-2) ◽  
pp. 97-123
Author(s):  
Didier Lime ◽  
Olivier H. Roux ◽  
Charlotte Seidner

We investigate the problem of parameter synthesis for time Petri nets with a cost variable that evolves both continuously with time, and discretely when firing transitions. More precisely, parameters are rational symbolic constants used for time constraints on the firing of transitions and we want to synthesise all their values such that some marking is reachable, with a cost that is either minimal or simply less than a given bound. We first prove that the mere existence of values for the parameters such that the latter property holds is undecidable. We nonetheless provide symbolic semi-algorithms for the two synthesis problems and we prove them both sound and complete when they terminate. We also show how to modify them for the case when parameter values are integers. Finally, we prove that these modified versions terminate if parameters are bounded. While this is to be expected since there are now only a finite number of possible parameter values, our algorithms are symbolic and thus avoid an explicit enumeration of all those values. Furthermore, the results are symbolic constraints representing finite unions of convex polyhedra that are easily amenable to further analysis through linear programming. We finally report on the implementation of the approach in Romeo, a software tool for the analysis of time Petri nets.


2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Anis M’halla ◽  
Dimitri Lefebvre ◽  
Mouhaned Gaied

This paper falls under the problems of the monitoring of a Discrete Event System (DES) with time constraints. Among the various techniques used for online and distributed monitoring, we are interested in the chronicle recognition. Chronicles are temporal patterns that represent the system’s possible evolutions. The proposed models are based on P-time Petri nets that are suitable to represent with accuracy and modularity the Tunisian railway network. These models are scalable and may be used to represent a large variety of railway networks. Then, monitoring is based on the generation of chronicles that are suitable to detect and isolate traffic incidents in a distributed setting. Consequently, the proposed approach is tractable for large networks. Finally, to demonstrate the effectiveness and accuracy of the approach, an application to the case study of the Tunisian railway network is outlined.


2017 ◽  
Vol 50 (1) ◽  
pp. 5843-5848
Author(s):  
F. Basile ◽  
P. Chiacchio ◽  
J. Coppola
Keyword(s):  

2020 ◽  
Vol 53 (4) ◽  
pp. 187-192
Author(s):  
Jan Komenda ◽  
Aiwen Lai ◽  
José Godoy Soto ◽  
Sébastien Lahaye ◽  
Jean-louis Boimond

Sign in / Sign up

Export Citation Format

Share Document