Learning in the recurrent random neural network
Neural Computation
G-networks with multiple classes of negative and positive customers
Theoretical Computer Science
A compositional approach to performance modelling
A compositional approach to performance modelling
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
IEEE Transactions on Software Engineering
Turning back time in Markovian process algebra
Theoretical Computer Science
Compositional reversed Markov processes, with applications to G-networks
Performance Evaluation
Separable equilibrium state probabilities via time reversal in Markovian process algebra
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Product form for stochastic automata networks
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Collaboration of discrete-time Markov chains: Tensor and product form
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
Product-form solution in PEPA via the reversed process
Network performance engineering
Multi-class network with phase type service time and group deletion signal
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Methodological construction of product-form stochastic Petri nets for performance evaluation
Journal of Systems and Software
Bibliography on G-networks, negative customers and applications
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
A recent result of Fourneau et al. derives conditions under which the joint state of a set of Markov chains with functional rates has a product-form solution for its equilibrium state probabilities, when they exist. The present note shows how the Reversed Compound Agent Theorem (RCAT) obtains the same result in a few lines. In fact a more general result also follows.