Markovian Petri Nets protocols with product form solution
Performance Evaluation
Efficient descriptor-vector multiplications in stochastic automata networks
Journal of the ACM (JACM)
The ubiquitous Kronecker product
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra
Performance Evaluation
IEEE Transactions on Software Engineering
Compositional reversed Markov processes, with applications to G-networks
Performance Evaluation
Product form for stochastic automata networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Discrete Event Dynamic Systems
Discrete Time Markov Chains Competing over Resources: Product Form Steady-State Distribution
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Computing the steady-state distribution of g-networks with synchronized partial flushing
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
An initiative for a classified bibliography on G-networks
Performance Evaluation
Bibliography on G-networks, negative customers and applications
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
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.