By Topic

Reachability of nonsynchronized choice Petri nets and its applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chao, D.Y. ; Dept. of Manage. & Inf. Sci., Nat. Cheng Chi Univ., Taipei, Taiwan

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.

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:35 ,  Issue: 6 )