An algebraic condition for product form in stochastic automata networks without synchronizations

We consider Stochastic Automata Networks (SANs) in continuous time and we prove a sufficient condition for the steady-state distribution to have product form. We consider synchronization-free SANs in which the transitions of one automaton may depend upon the states of the other automata. This model can represent efficiently multidimensional Markov chains whose transitions are limited to one component but whose rates may depend on the state of the chain. The sufficient condition we obtain is quite simple and our theorem generalizes former results on SANs as well as results on modulated Markovian queues, such as Boucherie's theory on competing Markov chain, on reversible queues considered by Kelly and on modulated Jackson queueing networks studied by Zhu. The sufficient condition and the proof are purely algebraic and are based on the intersection of kernels for a certain set of matrices.

[1]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[2]  Paulo Fernandes,et al.  Efficient descriptor-vector multiplications in stochastic automata networks , 1998, JACM.

[3]  Peter G. Harrison,et al.  Turning back time in Markovian process algebra , 2003, Theor. Comput. Sci..

[4]  Susanna Donatelli,et al.  Superposed Stochastic Automata: A Class of Stochastic Petri Nets with Parallel Solution and Distributed State Space , 1993, Perform. Evaluation.

[5]  Jane Hillston,et al.  An Efficient Kronecker Representation for PEPA Models , 2001, PAPM-PROBMIV.

[6]  E. Gelenbe.  Product-form queueing networks with negative and positive customers , 1991 .

[7]  Brigitte Plateau.  On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS 1985.

[8]  Jean-Michel Fourneau,et al.  G-Réseaux dans un environnement aléatoire , 2000, RAIRO Oper. Res..

[9]  Yixin Zhu,et al.  Markovian queueing networks in a random environment , 1994, Oper. Res. Lett..

[10]  J. Fourneau.  Domino synchronization: product form solution for stochastic automata networks , 2002 .

[11]  Richard J. Boucherie.  A Characterization of Independence for Competing Markov Chains with Applications to Stochastic Petri Nets , 1994, IEEE Trans. Software Eng..

[12]  Jean-Michel Fourneau,et al.  A Methodology for Solving Markov Models of Parallel Systems , 1991, J. Parallel Distributed Comput..

[13]  Peter G. Harrison.  Compositional reversed Markov processes, with applications to G-networks , 2004, Perform. Evaluation.

[14]  Paulo Fernandes,et al.  On the benefits of using functional transitions and Kronecker algebra , 2004, Perform. Evaluation.

[15]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[16]  Thomas G. Robertazzi,et al.  Markovian Petri Net Protocols with Product Form Solution , 1991, Perform. Evaluation.

[17]  Jane Hillston,et al.  Formal techniques for performance analysis: blending SAN and PEPA , 2007, Formal Aspects of Computing.

[18]  Alexandre Zenie,et al.  Colored Stochastic Petri Nets , 1985, PNPM.

[19]  Thomas G. Robertazzi,et al.  Service stage Petri net models with product form solution , 1990, Queueing Syst. Theory Appl..

[20]  E. Gelenbe.  G-networks by triggered customer movement , 1993 .

[21]  Jean-Michel Fourneau,et al.  PEPS: A Package for Solving Complex Markov Models of Parallel Systems , 1989 .