• DocumentCode
    389408
  • Title

    Reachability of synchronized choice Petri nets

  • Author

    Chao, Daniel Y.

  • Author_Institution
    Dept. of Manage. & Inf. Sci., Nat. Chengchi Univ., Taipei, Taiwan
  • Volume
    6
  • fYear
    2002
  • fDate
    6-9 Oct. 2002
  • Abstract
    A new local structure called Second Order Structure (SOS) is proposed to generate a new class of nets called Synchronized Choice Nets (SNC). SNC covers well-behaved FC. Reachability is no longer a P-Space hard problem, but can be translated into a structure problem and solved with polynomial time complexity.
  • Keywords
    Petri nets; computational complexity; reachability analysis; synchronisation; P-Space hard problem; Second Order Structure; Synchronized Choice Nets; polynomial time complexity; reachability; synchronized choice Petri nets; Bridge circuits; Chaos; Equations; Flexible manufacturing systems; Job shop scheduling; Law; Legal factors; Petri nets; Resource management; Virtual manufacturing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man and Cybernetics, 2002 IEEE International Conference on
  • ISSN
    1062-922X
  • Print_ISBN
    0-7803-7437-1
  • Type

    conf

  • DOI
    10.1109/ICSMC.2002.1175584
  • Filename
    1175584
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=389408