• DocumentCode
    3541982
  • Title

    Minimal time reachability problem of some subclasses of timed Petri nets

  • Author

    Ohta, Atsushi ; Tsuji, Kohkichi ; Hisamura, Tomiji

  • Author_Institution
    Aichi Prefectural Univ., Japan
  • fYear
    2005
  • fDate
    23-26 May 2005
  • Firstpage
    760
  • Abstract
    Timed Petri net is an effective tool to evaluate discrete event systems. This paper treats the reachability problem of timed Petri nets. The problem aims to find the firing sequence which drives the initial marking M0 to the target marking Mf in minimal execution time. First, we consider the subclass in which non-delayed sequence gives the optimal solution. Then, an algorithm is proposed to solve the minimal time reachability problem of timed state machines.
  • Keywords
    Petri nets; discrete event simulation; discrete event systems; reachability analysis; discrete event systems; firing sequence; initial marking; minimal execution time; minimal time reachability problem; nondelayed sequence; target marking; timed Petri net subclasses; timed state machines; Computational complexity; Discrete event systems; Fires; Mathematical model; Petri nets; Processor scheduling; Production systems; Real time systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on
  • Print_ISBN
    0-7803-8834-8
  • Type

    conf

  • DOI
    10.1109/ISCAS.2005.1464699
  • Filename
    1464699
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3541982