Skip to main content
Log in

Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

This work deals with performance evaluation of Conflicting Timed Event Graph (CTEG), a class of Petri net exhibiting phenomena such as synchronization, parallelism and resources sharing. It is well known that the dynamic of Timed Event Graphs (TEG) admits a linear state space representation in the (Max,+) algebra which makes the analysis and control of this class easier. There is also a possibility of associating conflicts with the TEGs by adding conflict places that are mostly considered as safe; this extended class is called CTEG. We first present an analytic evaluation of the cycle time of CTEG as a function of the cycle time of each TEG and of the timers of the conflict places. Finally, in a more general context, we look for a relaxation of the safety hypothesis on the conflict places in order to model and evaluate the cycle time on CTEGs with multiple shared resources.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  • Addad B, Amari S, Lesage J-J (2010) Modélisation de réseaux de graphes d’évènement temporisés avec conflits dans l’algèbre (Max,+). IEEE Conférence Internationale Francophone d’Automatique, Paper n°22 Nancy, France

  • Addad B, Amari S, Lesage J-J (2011) Genetic algorithms for delays evaluation in networked automation systems. Eng Appl Artif Intell 24(3):485–490

    Article  Google Scholar 

  • Addad B, Amari S, Lesage J-J (2012) Networked conflicting timed event graphs representation in (Max,+) algebra. Discrete Event Dyn Syst 22(4):429–449

    Article  MathSciNet  MATH  Google Scholar 

  • Alsaba M, Lahaye S, Boimond J-L (2006) On just in time control of switching max-plus linear systems. In Proceedings of ICINCO’06, Setubal, Portugal, pp. 79–84

  • Amari S, Demongodin I, Loiseau J-J, Martinez C (2012) Max-plus control design for temporal constraints meeting in timed event graphs. IEEE Trans Autom Control 57(2):462–467

    Article  MathSciNet  Google Scholar 

  • Baccelli F, Cohen G, Olsder G J, Quadrat J-P (1992) Synchronization and linearity: an algebra for discrete event systems. Wiley

  • Boutin O, Cottenceau B, L’Anton A, Loiseau J-J (2009) Modeling systems with periodic routing functions in dioid (Min,+), 13th IFAC Symposium on Information Control Problems in Manufacturing, Moscow, Russia, pp. 1377–1382

  • Corréïa A, Abbas TA, Bouyekhf R, El Moudni A (2009) A dioid model for invariant resource sharing problems. IEEE Trans Syst Man Cybern Syst Hum 39(4):770–781

    Article  Google Scholar 

  • Cottenceau B, Hardouin L, Boimond J-L, Ferrier J-L (1999) Synthesis of greatest linear feedback for timed event graph in dioid. IEEE Trans Autom Control 44(6):1258–1262

    Article  MathSciNet  MATH  Google Scholar 

  • Gaubert S, Mairesse J (1999) Modeling and analysis of timed Petri nets using heaps of pieces. IEEE Trans Autom Control 44(4):683–697

    Article  MathSciNet  MATH  Google Scholar 

  • Georges J-P (2006) A design process of switched Ethernet architectures according to real-time application constraints. Eng Appl Artif Intell 19(3):335–344

    Article  Google Scholar 

  • Hillion H, Proth J-M (1989) Performance evaluation of jobshop systems using timed event graphs. IEEE Trans Autom Control 34(1):3–9

    Article  MathSciNet  MATH  Google Scholar 

  • Houssin L, Lahaye S, Boimond J-L (2007) Just in time control of constrained (Max,+)-linear systems. Discrete Event Dyn Syst 17(2):159–178

    Article  MathSciNet  MATH  Google Scholar 

  • Lahaye S, Boimond J-L, Hardouin L (2004) Linear periodic systems over dioids. Discrete Event Dyn Syst 14(2):133–152

    Article  MathSciNet  MATH  Google Scholar 

  • Murata T (1989) Petri nets: properties analysis and applications. Proc IEEE 77(4):541–580

    Article  Google Scholar 

  • Nait SM, Manier MA, El Moudni A, Wack M (2006) Petri net with conflicts and (Max,plus) algebra for transportation systems, 11th IFAC Symposium on Transportation Systems, The Netherlands, pp. 548–553

  • Trouillet B, Korbaa O, Gentina JC (2007) Formal approach for fms cyclic scheduling. IEEE Trans Syst Man Cybern Part C Appl Rev 37(1):126–137

    Article  Google Scholar 

  • Van Den Boom T-J-J, De Schutter B (2006) Modelling and control of discrete event systems using switching Max-Plus linear systems. Control Eng Pract 14(10):1199–1211

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to W. M. Boussahel.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Boussahel, W.M., Amari, S. & Kara, R. Analytic evaluation of the cycle time on networked conflicting timed event graphs in the (Max,+) algebra. Discrete Event Dyn Syst 26, 561–581 (2016). https://doi.org/10.1007/s10626-015-0220-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-015-0220-3

Keywords

Navigation