Reachability of nonsynchronized choice Petri nets and its applications

Author

Chao, Daniel Y.

Author_Institution

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

Volume

35

Issue

6

fYear

2005

Firstpage

1203

Lastpage

1213

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.

Keywords

Petri nets; flexible manufacturing systems; reachability analysis; P-Space hard problem; deadlock detection; flexible manufacturing systems; nonsynchronized choice Petri net reachability; polynomial time complexity; second-order structure; synchronized choice nets; well-behaved free choice nets; Availability; Chaos; Flexible manufacturing systems; Petri nets; Polynomials; Power system modeling; Resource management; Samarium; System recovery; Virtual manufacturing; Deadlock; Petri nets; flexible manufacturing systems; reachability; Artifacts; Artificial Intelligence; Computer Simulation; Equipment Failure; Equipment Failure Analysis; Models, Theoretical; Motor Vehicles; Neural Networks (Computer); Robotics; Systems Integration;

fLanguage

English

Journal_Title

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on

Publisher

ieee

ISSN

1083-4419

Type

jour

DOI

10.1109/TSMCB.2005.850171

Filename

1542266