未來發展

未來研究方向可加入狀態間轉換需要耗費的時間，轉換時間包含機台加工時間，機台 間搬運時間，組裝時間等。更進一步說明，藉由中國郵差問題的運輸模式將狀態可達圖圖 形進行加邊時，時間參數等同於狀態間轉換所需要耗費的路徑成本，考慮時間參數進行最 短加邊路徑計算時，將有助於找出最佳的重複行經路徑，更能有效的縮短規範測試最短路 徑的搜尋。

其次，可針對五大步驟中的規格及偵察部分完成自動化軟體設計。對於規格部分，可 將系統利用IDEF0 定義規格後，直接轉成斐氏圖模式；對於偵查部分，則可套用擬陣理論 自動化產生偵察法則的通用程式。往後，管理者可透過套裝軟體通用程式完成自動化製造 系統的設計與實作中規格、驗證、撰碼、測試與監控的五大步驟自動化。藉由自動化規格 軟體，定義製造系統的規格並直接匯出斐氏圖模式；接著透過斐氏圖軟體其斐氏圖模式進 行系統驗證；連接自動化撰碼系統，將驗證過的斐氏圖模式直接撰碼為監控程式；透過本 研究提出的自動化規範測試軟體，快速的測試監控程式與實際機台的狀態轉換；最後，藉 由自動化偵查軟體提供的偵察法則，套入監控程式中，立即監控製造的運作情形，避免發 生任何當機現象。假以時日，更能將五大步驟的自動化套裝軟體整合，使得製造系統的全 面性整體規劃所需的五大步驟，只需透過一個套裝軟體，便能快速提升自動化製造系統的 設計與實作的執行效率。

56

[13] http://xserve.math.nctu.edu.tw/people/cpai/carnival/bridge/index.htm。七橋問題。2007 年 10 月 25 日。

[14] http://www.informatik.uni-hamburg.de/TGI/PetriNets/ Petri Nets World. October 25, 2007.

[15] http://www.lindo.com/. LINDO SYSTEMS INC. June 10, 2008.

[16] http://www.uml.org/. OMG. June 10, 2008.

[17] Boggey, T. B.,Graph Theory in Operations Research,1982.

[18] Bosik, B. S. and Uyer, M. U., “State Machine Based Formal Methods in Protocol Conference Testing: from Theory to Implementation,” Computer Networks and ISDN Systems, Vol. 22, pp. 7-33, 1991.

[19] Chartrand, G. and Oellermann, O. R., Applied and Algorithmic Graph Theory, McGraw-Hill, 1993.

[20] Eiselt, H. A., “Arc Routing Problems, Part I: The Chinese Postman Problem,” Operations Reasearch, Vol. 43, No. 2, pp. 231-242, 1995.

[21] Feng, L. J., “A Comparison of Matroid-Theoretical Monitor Design Methods,” Thesis, Department of Industrial Engineering and Management, National Chiao Tung University, 2001.

[22] Fleischner, H., Eulerian Graphs and Related Topics, Part1, Vol. 2, North-Holland, 1991.

[23] Hillier, F. S. and Lieberman, G. J., Introduction To Operation Research 7e, 1974.

[24] Hsueh, F. C., “Conformance Testing of Interactive Compact Disc Titles Using Chinese Postman Algorithm,” Thesis. Department of Industrial Engineering and Management, National Chiao Tung University, 1999.

[25] Lee, H. Y. and Lee, T. E., “Scheduling Single-Armed Cluster Tools With Reentrant Wafer Flows,” IEEE, Vol. 19, No. 2, pp. 226-240, 2006.

[26] Liang, G. R., “Network-integrated Production Lines,” Journal of the Mechatronic Industry, Vol. 172, pp. 207-220, 1997.

[27] Lin, Y. and Zhai, Y., “A New Algorithm for The Directed Chinese Postman Problem,”

57

Computer Operations Research, Vol. 15, No. 6, pp. 577-584, 1988.

[28] Murata, T., “Petri Nets: Properties, Analysis and Applications,” Proceedings of the IEEE, Vol. 77, No. 4, pp. 541-580, 1989.

[29] Pearn, W. L. and Li, M. L., “Algorithm for The Windy Postman Problem,” Computer Operations Research, Vol. 21, No. 6, pp. 641-651, 1994.

[30] Pearn, W. L. and Wu, T. C., “Algorithm for The Rural Postman Problem,” Computer Operations Research, Vol. 22, No. 8, pp. 819-828, 1995.

[31] Pearn, W. L., “Approximate Solutions For The Capacitated Arc Routing Problem,”

Computer Operations Research, Vol. 16, No. 6, pp. 589-600, 1989.

[32] Pearn, W. L. and Wang, K. H., “On the Maximum Benefit Chinese Postman Problem,”

Omega, Vol. 31, pp. 269-273, 2003.

[33] Ross, D. T., “Applications and Extensions of SADT,” Computer, pp. 25-34, 1985.

[34] Uzam, M., “The use of the Petri net reduction approach for an optimal deadlock prevention policy for flexible manufacturing systems,” International Journal of Advanced Manufacturing Technology, Vol. 23, pp. 204-219, 2004.

[35] Viswanadham, N., Narahari, Y., and Johnson, T. L., “Deadlock Prevention and Deadlock Avoidance in Flexible Manufacturing Systems Using Petri Net Models,” IEEE Trans.

Robots Automat., Vol. 6, No. 6, 1990.

58

fileChooser.setFileSelectionMode(JFileChooser.FILES_ONLY);

int result = fileChooser.showOpenDialog(this);

if (result == JFileChooser.CANCEL_OPTION) return;

File fileName = fileChooser.getSelectedFile();

if (fileName.exists()){

outputArea.setText(fileName.getName() + " exists" +

/* (fileName.isFile()? "is a file\n" : "is not a file\n") +