论文信息 - Equivalence Relations for Stochastic Automata Networks - 字舞流文

Equivalence Relations for Stochastic Automata Networks

[1] W. Stewart,et al. The numerical solution of stochastic automata networks , 1995 .

[2] P. Buchholz. Exact and ordinary lumpability in finite Markov chains , 1994, Journal of Applied Probability.

[3] Boudewijn R. Haverkort,et al. Specification techniques for Markov reward models , 1993, Discret. Event Dyn. Syst..

[4] Susanna Donatelli. Superposed stochastic automata: a class of stochastic Petri nets amenable to parallel solution , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[5] Brigitte Plateau,et al. Stochastic Automata Network For Modeling Parallel Systems , 1991, IEEE Trans. Software Eng..

[6] Jean-Michel Fourneau,et al. A Methodology for Solving Markov Models of Parallel Systems , 1991, J. Parallel Distributed Comput..

[7] Ushio Sumita,et al. Lumpability and time reversibility in the aggregation-disaggregation method for large markov chains , 1989 .

[8] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[9] Scott A. Smolka,et al. Fundamental Results for the Verification of Observational Equivalence: A Survey , 1987, PSTV.

[10] Donald Gross,et al. The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes , 1984, Oper. Res..

[11] Marc Davio,et al. Kronecker products and shuffle algebra , 1981, IEEE Transactions on Computers.

[12] John G. Kemeny,et al. Finite Markov chains , 1960 .