Block cutpoint decomposition for markovian queueing systems

Steady-state probabilities of Markov Processes are computed by enumerating subgraphs of the transition diagram of the process. The presence of cutpoints in the transition diagram allows for decomposition of the problem into smaller components. Examples from queueing theory are presented. Matrix representations for these structures are also discussed.