• DocumentCode
    2583920
  • Title

    Performance evaluation of discret event systems using P-time Event Graphs

  • Author

    Abdelhak, Guezzi ; Declerck, Ph

  • Author_Institution
    LISA, Univ. d´´Angers, Angers, France
  • fYear
    2009
  • fDate
    22-25 Sept. 2009
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    The dater equalities constitutes an appropriate tool which allows a linear description of timed event graph in the field of (max,+) algebra. This paper give an equivalent model in the standard algebra. The application of a variant of Farkas´lemma allow the necessary condition of existence of upper and lower bounds of the cycle time. A linear programming defined on the particular incidence matrix of the P-time event graph are used to compute the cycle time.
  • Keywords
    algebra; discrete event systems; graph theory; linear programming; (max,+) algebra; Farkas lemma; P-time event graphs; dater equalities; discret event systems; incidence matrix; linear description; linear programming; lower bound; necessary condition; performance evaluation; standard algebra; timed event graph; upper bound; Algebra; Circuits; Discrete event systems; Linear programming; Manufacturing systems; Multiprocessing systems; Petri nets; Timing; Transportation; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Emerging Technologies & Factory Automation, 2009. ETFA 2009. IEEE Conference on
  • Conference_Location
    Mallorca
  • ISSN
    1946-0759
  • Print_ISBN
    978-1-4244-2727-7
  • Electronic_ISBN
    1946-0759
  • Type

    conf

  • DOI
    10.1109/ETFA.2009.5347058
  • Filename
    5347058