Reachability of nonsynchronized choice Petri nets and its applications.
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.
Chao
Daniel Y
DY
Department of Management and Information Science, National Cheng Chi University, Taipei, Taiwan. yaw@mis.nccu.edu.tw
D016477:Artifacts; D001185:Artificial Intelligence; D003198:Computer Simulation; D004868:Equipment Failure; D019544:Equipment Failure Analysis / Q000379:methods*; D008962:Models, Theoretical; D018986:Motor Vehicles; D016571:Neural Networks, Computer; D012371:Robotics / Q000295:instrumentation / Q000379:methods*; D018511:Systems Integration