On the use of partial symmetries for lumping Markov chains
暂无分享,去创建一个
[1] Giovanni Chiola,et al. A Symbolic Reachability Graph for Coloured Petri Nets , 1997, Theor. Comput. Sci..
[2] A. Prasad Sistla,et al. Symmetry and model checking , 1993, Formal Methods Syst. Des..
[3] Giuliana Franceschinis,et al. Towards performance analysis with partially symmetrical SWN , 1999, MASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.
[4] Giovanni Chiola,et al. Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications , 1993, IEEE Trans. Computers.
[5] Giuliana Franceschinis,et al. Exploiting Partial Symmetries for Markov Chain Aggregation , 2000, Electron. Notes Theor. Comput. Sci..
[6] Giovanni Chiola,et al. GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets , 1995, Perform. Evaluation.
[7] Holger Hermanns,et al. Interactive Markov Chains , 2002, Lecture Notes in Computer Science.
[8] P. Buchholz. Exact and ordinary lumpability in finite Markov chains , 1994, Journal of Applied Probability.
[9] Jean-Michel Ilié,et al. Model Checking Through Symbolic Reachability Graph , 1997, TAPSOFT.