• DocumentCode
    1475778
  • Title

    Augmented reachability trees for 1-place-unbounded generalized Petri nets

  • Author

    Der Jeng, Mu ; Peng, Mao Yu

  • Author_Institution
    Dept. of Electr. Eng, Nat. Taiwan Ocean Univ., China
  • Volume
    29
  • Issue
    2
  • fYear
    1999
  • fDate
    3/1/1999 12:00:00 AM
  • Firstpage
    173
  • Lastpage
    183
  • Abstract
    An augmented reachability tree (ART) is proposed to extend the capability of the classical reachability tree (RT) for analyzing qualitative properties, such as liveness, of a class of unbounded generalized Petri nets, called 1-place-unbounded nets, where there is at most one unbounded place for each net. The idea is based on the computation of the minimal marking of each node in the tree. An algorithm for obtaining the minimal marking is shown. Examples are given to illustrate the technique. In addition to liveness, the proposed method can verify other properties such as reversibility and feasible firing sequences. Furthermore, properties verifiable by RT are also verifiable by ART
  • Keywords
    Petri nets; reachability analysis; trees (mathematics); 1-place-unbounded generalized Petri nets; augmented reachability trees; feasible firing sequences; liveness; minimal marking; qualitative properties; reversibility; Application software; Concurrent computing; Manufacturing systems; Mathematical model; Petri nets; Power system modeling; Protocols; Resource management; Subspace constraints; System recovery;
  • fLanguage
    English
  • Journal_Title
    Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1083-4427
  • Type

    jour

  • DOI
    10.1109/3468.747852
  • Filename
    747852