Reachability of nonsynchronized choice Petri nets and its applications

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

Volumn 35, Issue 6, 2005, Pages 1203-1213

  Chao, Daniel Y ^a  

^a NATIONAL CHENGCHI UNIVERSITY   (Taiwan)

Author keywords

Deadlock; Flexible manufacturing systems; Petri nets; Reachability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PETRI NETS; POLYNOMIALS; THEOREM PROVING;

DEADLOCK DETECTION; REACHABILITY; SYNCHRONIZED CHOICE NETS;

FLEXIBLE MANUFACTURING SYSTEMS;

ARTICLE; ARTIFACT; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; COMPUTER SIMULATION; EQUIPMENT; INSTRUMENTATION; METHODOLOGY; MOTOR VEHICLE; ROBOTICS; SYSTEM ANALYSIS; THEORETICAL MODEL;

ARTIFACTS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; EQUIPMENT FAILURE; EQUIPMENT FAILURE ANALYSIS; MODELS, THEORETICAL; MOTOR VEHICLES; NEURAL NETWORKS (COMPUTER); ROBOTICS; SYSTEMS INTEGRATION;

EID: 29144472285     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2005.850171     Document Type: Article

References (27)

1. J. Ezpeleta, J. M. Colom, and J. Martinez, "A Petri net based deadlock prevention policy for flexible manufacturing systems," IEEE Trans. Robot. Autom., vol. 11, no. 2, pp. 173-184, Apr. 1995.
2. Y. Huang, "Modeling, Analysis, Deadlock Prevention and Cell Controller Implementation for Flexible Manufacturing Systems," Ph.D., National Taiwan Univ. of Sci. & Technol., Taipei, 2001.
3. A. Ichikawa, K. Yokoyama, and S. Kurogi, "Control of event-driven systems - Reachability and control of conflict-free Petri nets," Trans. SICE, vol. 21, no. 4, pp. 324-330, 1985.
4. J. Ezpeleta and L. Recale, "Deadlock avoidance approach for nonsequential resource allocation systems," IEEE Trans. Syst,, Man, Cybern, A: Syst, Humans, vol. 34, no. 1, pp. 93-101, Jan. 2004.
5. E. Roszkowska, "Supervisory control for deadlock avoidance in compound processes," IEEE Trans. Syst,. Man, Cybern. A, Syst., Humans, vol. 34, pp. 52-64, Jan. 2004.
6. M. D. Jeng and F. Dicesare, "Synthesis using resource control nets for modeling shared-resource systems," IEEE Trans. Robot. Automat., vol. 11, no. 2, pp. 317-327, Apr. 1995.
7. M. Jeng, X. Xie, and S. L. Chung, "ERCN* merged nets for modeling degraded behavior and parallel processes in semiconductor manufacturing systems," IEEE Trans. Syst,. Man, Cybern. A, Syst., Humans, vol. 34, no. 1, pp. 102-112, Jan. 2004.
8. D. Y. Chao and J. A. Nicdao, "Liveness for synchronized choice Petri nets," Comput. J., vol. 44, no. 1, pp. 124-136, 2001.
9. M. C. Zhou and F. DiCesare, Petri Net Synthesis for Discrete Event Control of Manufacturing Systems. Boston, MA: Kluwer, 1993.
10. D. Y. Chao and D. T. Wang, "Two theoretical and practical aspects of knitting technique - Invariants and a new class of Petri net," IEEE Trans. Syst,. Man, Cybern. B, Cybern., vol. 27, pp. 962-977, 1997.
11. D. Y. Chao, "A computer aided design technique for flexible manufacturing systems synthesis utilizing Petri nets," in Computer-Aided Design, Engineering, and Manufacturing: Techniques and Applications. Boca Raton, FL: CRC Press, 2001, vol. III, Operational Methods in Computer Aided Design, pp. 8.1-8.64.
12. D. I. Lee, S. Kumagai, and S. Kodama, "Handles and reachability analysis of free choice nets," in Application and Theory of Petri Nets. New York: Springer-Verlag, 1995, vol. 935, LNCS, pp. 298-316.
13. J. Esparza, "Reachability in live and safe free choice Petri nets is NP-complete," Theor. Comp. Sci., vol. 198, no. 1-2, pp. 211-224, May 1998.
14. Z. Bouziane, "A primitive recursive algorithm for the general Petri net reachability problem," in Proc. 39th Annu. Symp. Foundations of Computer Science, 1998, pp. 130-136.
15. K. Hiraishi and A. Ichikawa, "A class of Petri nets that necessary and sufficient condition for reachability is a obtainable," Trans. SICE, Jap., vol. 24, no. 6, pp. 635-640, 1988.
16. K. Tsuji, "Useful necessary and sufficient condition for reachability of extended marked graphs," in Proc. ISCAS '98, vol. 3, pp. 330-333.
17. L. Ferrarini, "On the reachability and reversibility problems in a class of Petri nets," IEEE Trans. Syst,. Man, Cybern., vol. 24, pp. 1474-1482, Oct. 1994.
18. D. Y. Chao, "Reachability and firing sequences of synchronized choice nets," J. Inform. Sci. and Eng., vol. 21, pp. 129-152, 2005.
19. D. Y. Chao, "Extended synchronized choice nets," Comp. J., vol. 46, no. 5, pp. 505-523, 2003.
20. J. Desel and J. Esparza, "Shortest paths in reachability graphs," in Application and Theory of Petri Nets 1993. Chicago, IL: Springer-Verlag, 1993, vol. 691, LNCS, pp. 224-241.
21. J. Desel and J. Esparza, "Reachability in cyclic extended free choice Petri nets," Theor. Comp. Sci., vol. 114, pp. 93-118, 1993.
22. A. E. Kostin, "Reachability analysis in T-invariant-less Petri nets," IEEE Trans. Automat. Contr., vol. 48, pp. 1019-1024, Jun. 2003.
23. T. Matsumoto, Y. Miyano, and Y. Jiang, "Some useful sufficient criteria for the basic reachability problem in general Petri nets," in Proc. 36th IEEE Conf. Decision and Control, vol. 4, 1997, pp. 4104-4109.
24. A. A. Basten, "In Terms of Nets: System Design with Petri Nets and Process Algebra," Ph.D., Eindhoven Univ. Technology, Eindhoven, The Netherlands, 1998.
25. K. Lautenbach and H. Ridder, "Liveness in bounded Petri nets which are covered by T-invariants," in Application and Theory of Petri Nets, R. Valette, Ed. Zaragoza, Spain: Springer-Verlag, 1994, vol. 815, LNCS, pp. 358-378.
26. M. C. Zhou and F. DiCesare, "Parallel and sequential mutual exclusions for Petri net modeling of manufacturing systems with shared resources," IEEE Trans. Robot. Automat., vol. 7, no. 4, pp. 515-527, Aug. 1991.
27. F. Chu and X. L. Xie, "Deadlock analysis of Petri nets using siphons and mathematical programming," IEEE Trans. Robot. Automat., vol. 13, pp. 793-840, Dec. 1997.