Petri nets are widely used to model and analyze discrete-event systems. We consider in this paper timed event graphs1 with multipliers (TEGM’s). Such graphs are well adapted for modeling synchronization and saturation phenomena. The use of multipliers associated with arcs is natural to model a large number of systems, for example when the achievement of a specific task requires several units of a same resource, or when an assembly operation requires several units of a same part. Note that TEGM’s can not be easily transformed into (ordinary) TEG’s. It turns out that the proposed transformation methods suppose that graphs are strongly connected under particular server semantics hypothesis (single server in (Munier, 1993), or infinite server in (Nakamura and Silva, 1999)) and lead to a duplication of transitions and places. This paper deals with just in time control, i.e., fire input transitions at the latest so that the firings of output transitions occur at the latest before the desired ones. In a production context, such a control input minimizes the work in process while satisfying the customer demand. To our knowledge, works on this tracking problem only concern timed event graphs without multipliers (Baccelli et al., 1992, §5.6), (Cohen et al., 1989), (Cottenceau et al., 2001).
[1]
Tadao Murata,et al.
Petri nets: Properties, analysis and applications
,
1989,
Proc. IEEE.
[2]
C. Leake.
Synchronization and Linearity: An Algebra for Discrete Event Systems
,
1994
.
[3]
Bertrand Cottenceau,et al.
Model reference control for timed event graphs in dioids
,
2001,
Autom..
[4]
G. Cohen,et al.
Timed-event graphs with multipliers and homogeneous min-plus systems
,
1998,
IEEE Trans. Autom. Control..
[5]
E. Menguy,et al.
Contribution a la commande des systemes lineaires dans les dioides
,
1997
.
[6]
Manuel Silva,et al.
Cycle time computation in deterministically timed weighted marked graphs
,
1999,
1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467).
[7]
J. Quadrat,et al.
Algebraic tools for the performance evaluation of discrete event systems
,
1989,
Proc. IEEE.
[8]
G. Cohen,et al.
Idempotency: Algebraic system analysis of timed Petri nets
,
1998
.