Reachability of nonsynchronized choice Petri nets and its applications

  • Authors:

  • D. Y. Chao

  • Affiliations:

  • Dept. of Manage. & Inf. Sci., Nat. Cheng Chi Univ., Taipei, Taiwan

  • Venue:
  • IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new local structure called a second-order structure was proposed to generate a new class of nets called synchronized choice nets (SNC). SNC covers well-behaved free choice nets. Reachability is no longer P-Space hard problem, but can be solved with polynomial time complexity. How to extend them to non-SNC and its application to deadlock detection in flexible manufacturing systems are discussed.