雲端運算是近來全世界最熱門的資訊議題，任何設備只要能夠連上網路，就可以享有各種不同的網路服務，這些服務可能建置在不同的機器設備上，甚至可能在相隔遙遠的雲端裡，因此也稱之為雲端服務，在操作過程中，使用者不需要擔心服務安裝在哪裡，亦不用擔心服務如何達成，可想而知網路服務的背後，隱藏著很複雜的技術與架構。 網路服務的開發方式相當地簡單且快速，為系統帶來更大的便利與彈性，不過在管理的部份，卻變得越來越複雜，例如不易瞭解網路的結構與狀態、潛在的無窮迴圈及冗餘的流程問題，甚至是在資源共享的情況下，因等待或其他因素而導致死結的情況產生。這些問題將使得網路服務組合在執行時期，可能發生無法預期的錯誤。情況嚴重時，系統可能會完全鎖死或停止，對公司將造成重大的財務及商譽上的損失。這些流程的問題，需要在網路服務組合執行前先進行驗證，本研究透過流程轉換成派翠網路的分析，以確保流程設計的正確性與穩定性。 因此，本論文運用網路服務標準，將雲端服務轉換成派翠網路模型，再以派翠網路中的針織法為分析基礎，檢驗模型的狀態，避免死結發生，並提供網路特徵報告書，以降低管理的複雜度，進而提升服務的穩定性。 / Cloud computing is regarded as the most popular recent ICT topic. Any equipment which can be connected to Internet can provide its user have the access to the various services, which may be built on different machines, or even may exist in the distant 'clouds' far away. However, in the operating process, the user has no need to worry where the service locates, needless to say how the service operates, which means that a considerably amount of data and techniques hide behind the Web service. Web service is an artifical piece of art, the user and the manager can concatenate several Web services online into a bigger one according to the conditions they need, which is a considerably simple and fast developing method bringing more convenience and flexibility for the system. Nonetheless, the managerial part also becomes more complex in problems like potential infinite loops and abundant procedures, for instance. What is worse is under the circumstance of resource sharing, the deadlocks happen while pending or other factors occur. These issues will lead to severe errors while the Web service compound operates. If the system completely locks and stops, serious financial damage and loss of commercial reputation will be caused to the company. Hence the design of procedures needs to be validated and transformed as Petri Net analysis before the Web service compound operates in order to assure the accuracy and stability of the procedure design. Therefore, this paper uses Web service standards, turning Web services into Petri Net models with knitting technique as analytical base, to validate the accuracy and stability of the model to avoid deadlock to happen in order to enhance the reliability of the service.

因應物聯網、機器人和雲端計算等系統快速的科技創新，我們需要更有效之方法來模型化由上述系統所架構出來愈趨複雜的動態資源配置系統，以解決類似瓶頸、死結等潛藏的系統控制相關問題。為了解決以派翠網路模型化大型系統一直存在的指數倍數成長之複雜性問題，一個即使運用MIP（混合整數規劃）方法於可達性分析也是完全NP（非確定性多項式時間）的問題，趙玉教授率先以開發k階和k網系統的控制相關狀態(CRSs)數量之封閉形式解決方案(簡稱封閉解)，來突破此一指數倍數成長複雜性的障礙。然而，對稱網路結構的屬性，限縮了此兩系統在模型化系統中可應用的範圍;同時由於不可避免的死結的狀況，也阻礙了兩個系統的並行處理能力。為了延伸派翠網路封閉解的研究領域至非對稱系統，及強化對大型即時動態資源分配非對稱系統的模型化能力，本論文擴展派翠網路封閉解的研究領域至所謂的「左邊一般化k階系統」、「左邊一般化k網系統」和「A網系統」等三種不同類型的基本非對稱系統。「左邊一般化k階（相對於k網）系統」是在k階（相對於k網）之控製行程的任意位置，使用一非共享資源的網路模型，為模型化具有客製化製程系統之基本網路架構; 「A網系統」是在一k階系統中，連接一頂層非共享圈子網（TNCS）的網路模型，在實際應用中，為模型化具共享相同製程系統的基本網路架構。本論文透過非共用資源在等價網路(k階（相對於k網）)的影響性分析，及其等價網路之封閉解為基礎，建構「左邊一般化k階（相對於k網）系統」之封閉解;在「A網系統」中，由於TNCS和連接的缺陷 k階系統兩個子系統的獨立性，首先我們可以從其相關之k階系統的封閉解中，排除不可能狀態的數量，推導出缺陷k階系統的封閉解，然後以累計加總缺陷k階系統及TNCS兩個子系統在各種TNCS中存在不同權杖個數狀況下的封閉解乘積，構建出「A網系統」的封閉解。在實際應用中，我們可透過由封閉解所產生之即時CRS信息，強化對大型動態即時資源分配系統的模型化能力。例如，採用本論文所提出的避免死結演算法，可以在不用附加控制器之狀況下，實現k階和k網系統之並行處理的功能;並且可以在k-網系統中，在不用暫停所有系統的工作流程狀況下，實現動態行程配置的功能。除了應用虹吸計算方法構建非對稱系統的基礎封閉解外，本論文還提出了依據其反向網路被驗證的有效信息為基準，新的由模型驗證之以知識基礎的理論分析方法，加速派翠網路封閉解的建構。在此，本論文開啟了以變型k階系統為啟端，建構派翠網路封閉解新的研究時代。 / In the light of the rapid innovation of the Internet of Things (IoT), robot systems, and cloud computing systems, we need an efficient methodology to model gradually more and more complicated, real-time resource allocation systems (RAS), constructed using the systems mentioned above, for solving issues such as bottlenecks, deadlocks, and other embedded system-control-related problems. To solve the exponentially increasing complexity in the persistent problem of modeling large systems using Petri nets, which is an NP (nondeterministic polynomial time)-complete problem even when MIP (mixed integer programming) is employed for reachability analysis, Chao broke this barrier by developing the first closed-form solution (CFS) for the number of Control Related States (CRSs) for k-th order and k-net systems. However, the properties of symmetric net structures limit their application range in modeling systems; the inevitable deadlock obstructs the capability of concurrent processing in both systems. To enhance the capability of modeling large dynamic, real-time resource allocation in asymmetric systems, this dissertation extends the research on the CFS of PNs to the so-called Gen-Left k-th order system, the Gen-Left k-net system, and the A-net system, which comprise the three different types of fundamental asymmetric systems. A Gen-Left k-th order (resp. k-net) system is a k-th order (resp. k-net) system containing a non-sharing resource (NSR) at arbitrary locations in the control process, which is the fundamental net structure for modeling contained customized manufacturing processes inside a system. An A-net system is a k-th order system connected to a Top Non-sharing Circle Subnet (TNCS), which is the fundamental net structure to model a shared common manufacturing processing system in real applications. Based upon analyzing the effects of one NSR in the equivalent, the corresponding k-th order (resp. k-net) system, and an equivalent CFS, this dissertation derives the CFS for the Gen-Left k-th order (resp. k-net) system. Due to the independence of the TNCS and the connected Deficient k-th order system, we can first derive the CFS for a Deficient k-th order system just by excluding the number of impossible states from the CFS for its corresponding k-th order system. Then, the CFS of an A-net is constructed by summing the products of the CFS for the two sub-systems in each different case under the condition of the number of tokens inside TNCS. Based on real-time CRS information derived, we can enhance the capability for modeling a large dynamic, real-time resource allocation system in real applications. Employing the proposed deadlock-avoidance algorithm, for instance, we can realize concurrent processing in both k-th order and k-net systems without additional controllers being implemented; and the function of dynamic process allocation in a k-net system without suspending the system’s working flows. In addition to applying siphon computation to construct the fundamental CFS for asymmetric systems, this dissertation pioneers and proposes a new knowledge-based, analysis methodology, called proof by model, to accelerate the construction of the CFS for a PN based upon the validation information from its reverse net. This dissertation opens a new research era for constructing the CFS for PNs beginning from the Variant k-th order system.