這一篇論文裡，我們討論如何計算開放式有限容量等候系統的穩定機率。其中到達時間和服務時間的機率分配都是Coxian分配。我們利用向量表示法（Product-Form Method）求解穩定機率，並建立C_{k}/C_{m}/1/4與C_{k}/C_{m}/1/6的穩定機率之表格。在使用向量表示法的過程中，計算所需的時間與系統容量無關。因此，在我們計算穩定機率的經驗中，當N>100時，我們可以明顯感覺出向量表示法比一般傳統方法有更快的計算速度。 / In this thesis, we study the C_{k}/C_{m}/1/N open queueing system with finite capacity, N. We use the product-form method to solve the steady-state probabilities and give tables of numerical results in examples of C_{k}/C_{m}/1/4 and C_{k}/C_{m}/1/6. The merit of this method is that the computation time is independent of N. In our computational experiments, we have observed that when the capacity size of queueing system, N>100, the computing efficiency of the product-form method is much better than that of a traditional method.

在這一篇論文裡，我們討論兩個階段的封閉式等候線網路，其中服務時間的機率分配都是Phase type分配。我們猜測服務時間的機率分配和離開時間間隔的機率分配滿足一組聯立方程組。然後，我們推導出非邊界狀態的穩定機率可以被表示成 product-form的線性組合，而每個product-form可以用聯立方程組的根來構成。利用非邊界狀態的穩定機率， 我們可以求出邊界狀態的機率。最後我們建立一個求穩定機率的演算過程。利用這個演算方法，可以簡化求穩定機率的複雜度。 / In this thesis, we are concerned with the property of a two-stage closed system in which the service times are identically of phase type. We first conjecture that the 　Laplace-Stieltjes Transforms (LST) of service time distributions may satisfy a system of equations. Then we present that the stationary probabilities on the unboundary states can be written as a linear combination of product-forms. Each component of these products can be expressed in terms of roots of the system of equations. Finally, we establish an algorithm to obtain all the stationary probabilities. The algorithm is expected to work well for relatively large customers in the system.