Product form for Stochastic Automata Networks

Jean-Michel Fourneau (1) , Brigitte Plateau (2, 3) , William J. Stewart (4)

1 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
2 LIG - Laboratoire d'Informatique de Grenoble
3 MESCAL - Middleware efficiently scalable
4 NCSU - Department of Computer Science

We consider Stochastic Automata Networks (SAN) in continuous time and we prove a sufficient condition for the steady-state distribution to have product form. We consider SAN without synchronizations where the transitions of one automaton may depend of the states of the other automata. Even with this restriction, this sufficient condition is quite simple and this theorem generalizes former results on SAN but also on modulated Markovian queues, such as the Boucherie's theory on competing Markov chain, or on reversible queues considered by Kelly. The sufficient condition and the proof are purely algebraic.

Mots clés: Performance of Systems; Modeling techniques; Performance attributes; Probability and Statistics; Markov processes

Domaines: Performance et fiabilité [cs.PF]

Jean-Michel Fourneau, Brigitte Plateau, William J. Stewart. Product form for Stochastic Automata Networks. 2nd International Conference on Performance Evaluation Methodologies and Tools, Oct 2007, Nantes, France. pp.1-10, ⟨10.4108/valuetools.2007.1980⟩. ⟨hal-00203526⟩