Structured solution of asynchronously communicating stochastic modules

Asynchronously Communicating Stochastic Modules (SAM) are Petri nets that can be seen as a set of modules that communicate through buffers, So they are not (yet another) Petri net subclass, but they complement a net with a structured view. This paper considers the problem of exploiting the compositionality of the view to generate the state space and to find the steady-state probabilities of a stochastic extension of SAM in a net-driven, efficient way. Essentially, we give an expression of an auxiliary matrix, G, which is a supermatrix of the infinitesimal generator of a SAM. C: is a tensor algebra expression of matrices of the size of the components for which it is possible to numerically solve the characteristic steady-state solution equation rr G = 0,without the need to explicitly compute G. Therefore, we obtain a method that computes the steady-state solution of a SAM without ever explicitly computing and storing its infinitesimal generator, and therefore without computing and storing the reachability graph of the system. Some examples of application of the technique are presented and compared to previous approaches.