Reference: | [1] Chao, D.Y., “A CAD Tool for Constructing Large Petri Nets,” revised for IEEE Trans. SMC.
[2] Chao, D.Y., “Application of a Synthesis Algorithm to Flexible Manufacturing System,” Journal of Information Science and Engineering, Vol. 14, No. 2, June 1998, pp. 409-447.
[3] Chao, D.Y, “Linear Algebra Based Verification of Well-Behaved Properties and S-invariants of Petri Nets Synthesized Using Knitting Technique,” MIS Review, Vol. 5, December 1995, pp. 27-48.
[4] Chao, D.Y., “The Algorithm for Checking Liveness in Synchronized Choice Net,” (invited) Proc. 1999 IEEE Int’l Conf. SMC, Beijing, China, July 5-9, 1999.
[5] D.Y. Chao and Jose A. Nicdao,”Liveness for Synchronized Choice Petri Nets,” Computer Journal (British Computer Society), Vol. 44, No. 1, 2001, pp. 124-136.
[6] D.Y. Chao and Jose A. Nicdao, “Extended Synchronized Choice Nets,” Workshop on Algorithms and Theory of Computation, ICS2000, December 6-8, pp. 123-130.
[7] Chao, D.Y. and D.T. Wang, “Two Theoretical and Practical Aspects of Knitting Technique—Invariants and A New Class of Petri Net,” IEEE Transactions on System, Man, and Cybernetics, Vol. 27, No.6, 1997, pp.962-937.
[8] Chao, D.Y., Jose A. Nicdao, Jih-Hsin Tang and Yi-Kung Chen, “Second Order Structures for Synchronized Choice Ordinary Petri Nets,” the Third World Multiconference on Systemics, Cybernetics and Informatics (SCI`99) and the Fifth International Conference on Information Systems Analysis and Synthesis (ISAS`99), Orlando, USA, July 31-August 4, 1999, Proceedings Volume 5 Computer Science and Engineering, pp. 336-343.
[9] Chao, D.Y., M.C. Zhou, and D.T. Wang, “Extending Knitting Technique to Petri Net Synthesis of Automated Manufacturing Systems,” Computer Journal (British Computer Society), Oxford University Press, Vol. 37, No. 1-2, pp. 1-10.
[10] Desel, J. and J. Esparza, Free Choice Petri Nets, Cambridge University Press, 1995.
[11] Dong-Ik Lee, Sadatoshi Kumagai and Shinzo Kodama, “Complete Structural Characterization of State Machine Allocatable Nets,” IEICE Transactions, Vol. E74, No. 10, pp.3115-3123, October 1991.
[12] Dong-Ik Lee, Sadatoshi Kumagai and Shinzo Kodama, “Handles and Reachability Analysis of Free choice Nets,” In Application and Theory of Petri Nets, LNCS, No. 935, Springer-Verlag, pp.298-316, 1995.
[13] Esparza, J. and M. Silva, “Circuits, Handles, Bridges, and Nets,” Advances in Petri Nets, Lecture Notes in Computer Science, 1991, Springer Verlag, pp. 210-242.
[14] Ezpeleta, J., J.M. Colom, and J. Martinez, “A Petri Net Based Deadlock Prevention Policy for Flexible Manufacturing Systems,” IEEE Transactions on Robotics and Automation, Vol. 11, No. 2, April 1995, pp. 173-184.
[15] Jeng, M.D. and F. DiCesare, “A Modular Synthesis Techniques for Petri Nets,” Japan-USA Sym. on Flexible Automation, 1992, pp. 1163-1170.
[16] Krogh, B.H. and C.L. Beck, “Synthesis of Place/Transition Net for Simulation and Control of Manufacturing System,” Proc. IFIP Symp. Large Scale Systems, Zurich, Aug. 1986.
[17] M. D. Jeng, F. Dicesare, “Synthesis Using Resource Control Nets for Modeling Shared-Resource Systems,” IEEE Transactions on Robotics and Automation, Vol. 11, No. 2 April 1995, pp. 317-327.
[18] Murata, T., “Circuit Theoretic Analysis and Synthesis of Marked Graphs,” IEEE Trans. Circ. and Sys., CAS-24, No. 7, 1977, pp. 400-405.
[19] Murata, T., “Petri Nets: Properties, Analysis and Applications,” IEEE Proceedings, Vol. 77, No. 4, April 1989, pp. 541-580.
[20] Murata, T. and J. Y. Koh, “Reduction and Expansion of Live and Safe Marked Graphs,” IEEE Trans. Circ. and Sys., CAS-27, 1980, pp. 68-70.
[21] Peterson, J.L., Petri Net Theory and the Modeling of Systems, Prentice-Hall, Englewood Cliffs, New Jersey, 1981.
[22] R. J. Lipton, “The reachability problem requires exponential space,” New Haven, CT, Yale University, Dept. of Computer Science, Res. Rep. 62, 1976.
[23] Chu, F.; Xie, X.-L., “Deadlock analysis of Petri nets using siphons and mathematical programming,” IEEE Trans. on Robotics and Automation, Vol. 13, No. 6, 1997, pp. 793-804. |