The aim of this paper is the generation of the min-critical and max-critical subsystems which determine the optimal cycle times. Considering a Time Interval Model which can describe Timed Event Graphs and P-time Event Graphs completely, each critical subsystem depends on the lower and upper bounds of the time durations. The proposed approach which is based on linear programming makes a classification of the relations which describe the system. The application to a baking process in a plant bakery shows that the min-critical and max-critical subsystems are not limited to the critical circuits of the Event Graph.

中文翻译：

---

时间间隔模型中的关键子系统

本文的目的是生成确定最佳循环时间的最小临界和最大临界子系统。考虑到可以完整描述定时事件图和 P 时间事件图的时间间隔模型，每个关键子系统都取决于持续时间的下限和上限。所提出的基于线性规划的方法对描述系统的关系进行分类。对植物面包店烘焙过程的应用表明，最小临界和最大临界子系统不限于事件图的临界电路。