Some Results on Near-complete Decomposability of Discrete Event Systems

In this paper, near-comp 1ete decomposabllity of closed networks with finite buffer and serial production line with finite buffer is studide. The sufficient conditions for systems to be nearly completely decomposable are derived, which can be expressed as a function of aggregates. The steady-state probabi1ities of systems are sought.