Service stage Petri net models with product form solution
Queueing Systems: Theory and Applications
A methodology for solving Markov models of parallel systems
Journal of Parallel and Distributed Computing
Markovian Petri Nets protocols with product form solution
Performance Evaluation
Efficient descriptor-vector multiplications in stochastic automata networks
Journal of the ACM (JACM)
Computer Networks and Systems: Queueing Theory and Performance Evaluation
Computer Networks and Systems: Queueing Theory and Performance Evaluation
IEEE Transactions on Software Engineering
International Workshop on Timed Petri Nets
Turning back time in Markovian process algebra
Theoretical Computer Science
Compositional reversed Markov processes, with applications to G-networks
Performance Evaluation
On the benefits of using functional transitions and Kronecker algebra
Performance Evaluation
Formal techniques for performance analysis: blending SAN and PEPA
Formal Aspects of Computing
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
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
Complex synchronizations in Markovian models: a tensor-based proof of product form
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Collaboration of discrete-time Markov chains: Tensor and product form
Performance Evaluation
Product form approximations for communicating Markov processes
Performance Evaluation
State-dependent rates and semi-product-form via the reversed process
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
G-networks with synchronised arrivals
Performance Evaluation
An initiative for a classified bibliography on G-networks
Performance Evaluation
Monotone queuing networks and time parallel simulation
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
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
Exploiting product forms solution techniques in multiformalism modeling
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We consider Stochastic Automata Networks (SANs) in continuous time and we prove a sufficient condition for the steady-state distribution to have product form. We consider synchronization-free SANs in which the transitions of one automaton may depend upon the states of the other automata. This model can represent efficiently multidimensional Markov chains whose transitions are limited to one component but whose rates may depend on the state of the chain. The sufficient condition we obtain is quite simple and our theorem generalizes former results on SANs as well as results on modulated Markovian queues, such as Boucherie's theory on competing Markov chain, on reversible queues considered by Kelly and on modulated Jackson queueing networks studied by Zhu. The sufficient condition and the proof are purely algebraic and are based on the intersection of kernels for a certain set of matrices.