If all queueing places are satisfying (#>
:
Obviously the state space of the QPN is finite if the domain of
function 
is finite
for a given 
.
Proof:
Obvious. 
=0(7) is normally satisfied by queues.
Theorem 3 demonstrates that boundedness is no serious
problem in the analysis of QPNs.