Complex synchronizations in Markovian models: a tensor-based proof of product form

We consider complex synchronizations in a generalized network of queues with signals (Gnetwork) or Stochastic Automata Networks without functions. Both models allow to describe their continuous time Markov chain as a summation of tensor (or Kronecker) products and sums of local description of queues (or automata). We give a purely algebraic proof of the product form results based on properties of the tensor products. These results generalizes many well-known results in queueing theory but also on all the models which allow a tensor based representation such as Stochastic Petri Nets or Stochastic Process Algebra.

[1]  Jean-Michel Fourneau,et al.  Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor , 2009, ASMTA.

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

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  Erol Gelenbe,et al.  G-Networks with resets , 2002 .

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

[6]  Jean-Michel Fourneau.  Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations , 2008, EPEW.

[7]  Jean Mairesse,et al.  Zero-Automatic Networks , 2006, valuetools '06.

[8]  Jean-Michel Fourneau,et al.  Product form for stochastic automata networks , 2007, Valuetools 2007.

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

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

[11]  C. Loan.  The ubiquitous Kronecker product , 2000 .

[12]  Jean-Michel Fourneau,et al.  An algebraic condition for product form in stochastic automata networks without synchronizations , 2008, Perform. Evaluation.

[13]  Michael Pinedo,et al.  Queueing networks - customers, signals and product form solutions , 1999, Wiley-Interscience series in systems and optimization.

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

[15]  Jean-Michel Fourneau,et al.  Computing the Steady-State Distribution of G-networks with Synchronized Partial Flushing , 2006, ISCIS.

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

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

[18]  Nico M. van Dijk,et al.  On Jackson's product form with 'jump-over' blocking , 1988 .

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

[20]  Jean-Michel Fourneau.  Discrete Time Markov Chains Competing over Resources: Product Form Steady-State Distribution , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.