Reversed compound agent theorem

In probability theory, the reversed compound agent theorem (RCAT) is a set of sufficient conditions for a stochastic process expressed in the PEPA language to have a product form stationary distribution[1] (assuming that the process is stationary[2][1]). The theorem shows that product form solutions in Jackson's theorem,[1] the BCMP theorem[3] and G-networks are based on the same fundamental mechanisms.[4]

The theorem identifies a reversed process using Kelly's lemma, from which the stationary distribution can be computed.[1]

References

  1. 1 2 3 4 Harrison, P. G. (2003). "Turning back time in Markovian process algebra". Theoretical Computer Science 290 (3): 1947–2013. doi:10.1016/S0304-3975(02)00375-4.
  2. ↑ Harrison, P. G. (2006). "Process Algebraic Non-product-forms" (PDF). Electronic Notes in Theoretical Computer Science 151 (3): 61–06. doi:10.1016/j.entcs.2006.03.012.
  3. ↑ Harrison, P. G. (2004). "Reversed processes, product forms and a non-product form". Linear Algebra and its Applications 386: 359–201. doi:10.1016/j.laa.2004.02.020.
  4. ↑ Hillston, J. (2005). "Process Algebras for Quantitative Analysis". 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05) (PDF). pp. 239–248. doi:10.1109/LICS.2005.35. ISBN 0-7695-2266-1.

External links

This article is issued from Wikipedia - version of the Friday, September 04, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.