Markovian Petri Nets protocols with product form solution
Performance Evaluation
Efficient descriptor-vector multiplications in stochastic automata networks
Journal of the ACM (JACM)
Product form solution for a class of PEPA models
IPDS '98 Proceedings of the third IEEE international performance and dependability symposium on International performance and dependability symposium
Stochastic Automata Networks and Near Complete Decomposability
SIAM Journal on Matrix Analysis and Applications
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
Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks
Performance Evaluation
Product form for stochastic automata networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
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
An initiative for a classified bibliography on G-networks
Performance Evaluation
Markovian queueing network with complex synchronizations: Product form and tensor
Performance Evaluation
Bibliography on G-networks, negative customers and applications
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
We present a new kind of synchronization which allows Continuous Time Stochastic Automata Networks (SAN) to have a product form steady-state distribution. Unlike previous models on SAN with product form solutions, our model allows synchronization between three automata but functional rates are not allowed. The synchronization is not the usual "Rendez-Vous" but an ordered list of transitions. Each transition may fail. When a transition fails, the synchronization ends but all the transitions already executed are kept. This synchronization is related to the triggered customer movement between queues in a network and this class of SAN is a generalization of Gelenbe's networks with triggered customer movement.