Collaboration of discrete-time Markov chains: Tensor and product form
暂无分享,去创建一个
[1] Peter G. Taylor,et al. Product form in networks of queues with batch arrivals and batch services , 1990, Queueing Syst. Theory Appl..
[2] Paulo Fernandes,et al. Efficient descriptor-vector multiplications in stochastic automata networks , 1998, JACM.
[3] Jane Hillston,et al. Product Form Solution for a Class of PEPA Models , 1999, Perform. Evaluation.
[4] Jean-Michel Fourneau,et al. Product form for stochastic automata networks , 2007, Valuetools 2007.
[5] Jane Hillston,et al. Product form solution for an insensitive stochastic process algebra structure , 2002, Perform. Evaluation.
[6] Richard J. Boucherie. A Characterization of Independence for Competing Markov Chains with Applications to Stochastic Petri Nets , 1994, IEEE Trans. Software Eng..
[7] Paulo Fernandes,et al. PEPS2007 - Stochastic Automata Networks Software Tool , 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).
[8] Peter G. Harrison,et al. Product-forms and functional rates , 2009, Perform. Evaluation.
[9] Jean-Michel Fourneau,et al. Stochastic Automata Networks with Master/Slave Synchronization: Product Form and Tensor , 2009, ASMTA.
[10] Peter G. Harrison. Compositional reversed Markov processes, with applications to G-networks , 2004, Perform. Evaluation.
[11] Jean-Michel Fourneau,et al. An algebraic condition for product form in stochastic automata networks without synchronizations , 2008, Perform. Evaluation.
[12] M. E. Woodward,et al. Communication and computer networks - modelling with discrete-time queues , 1993 .
[13] Jane Hillston,et al. An Efficient Kronecker Representation for PEPA Models , 2001, PAPM-PROBMIV.
[14] Hans Daduna. Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks , 2001 .
[15] Jean-Michel Fourneau,et al. Performance Evaluation of Buffer Policies with Stochastic Automata Networks , 1993, Modelling and Evaluation of ATM Networks.
[16] P. Moran,et al. Reversibility and Stochastic Networks , 1980 .
[17] Danielle Liu,et al. The censored Markov chain and the best augmentation , 1996, Journal of Applied Probability.
[18] Jean-Michel Fourneau. Discrete Time Markov Chains Competing over Resources: Product Form Steady-State Distribution , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.
[19] Jean-Michel Fourneau,et al. PEPS: A Package for Solving Complex Markov Models of Parallel Systems , 1989 .
[20] Susanna Donatelli,et al. Superposed Stochastic Automata: A Class of Stochastic Petri Nets with Parallel Solution and Distributed State Space , 1993, Perform. Evaluation.
[21] Brigitte Plateau. On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS 1985.
[22] Carl D. Meyer,et al. Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems , 1989, SIAM Rev..
[23] Anne Benoit,et al. Réseaux d'automates stochastiques à temps discret , 2005, Tech. Sci. Informatiques.
[24] Brigitte Plateau,et al. Stochastic Automata Network For Modeling Parallel Systems , 1991, IEEE Trans. Software Eng..