A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
Obtaining performance models, like Markov chains and queueing networks, for systems of signiÿcant complexity and magnitude is a di cult task that is usually tackled using human intelligence and experience. This holds in particular for performance models of a highly irregular nature. In this paper we argue by means of a non-trivial example -a plain-old telephone system (POTS) -that a stochastic extension of process algebra can diminish these problems by permitting an automatic generation ofdoi:10.1016/s0167-6423(99)00019-2 fatcat:pdlatyqevbhaznccsdb3jhbena