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
An Efficient Kronecker Representation for PEPA Models
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
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
Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
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
Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
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
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 generalize 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.