节点文献
交互式马尔科夫链上强模拟关系的计算
Computation of strong simulation relationships on interactive Markov chains
【摘要】 对随机进程代数模型交互式马尔科夫链(IMCs)上的模拟关系进行研究,根据不动点定理和权函数的定义,给出交互式马尔可夫链模型上强互模拟等价和强模拟前序的判定算法,对算法的时间复杂度进行分析.
【Abstract】 Simulation relation on interactive Markov chains(IMCs) of algebraic model for stochastic process was studied,and by using the fixed-point theory and weight function definition,the discrimination algorithms for strong bisimulation equivalence and strong simulation preorder on stochastic process algebraic IMCs were given and the temporal complexity of the given algorithms was analyzed,also.
【关键词】 交互式马尔可夫链;
强互模拟等价;
强模拟前序;
算法;
计算复杂度;
【Key words】 interactive Markov chains; strong bisimulation; strong simulation preorder; algorithm; computational complexity;
【Key words】 interactive Markov chains; strong bisimulation; strong simulation preorder; algorithm; computational complexity;
【基金】 甘肃省自然科学基金(3ZS051-A25-047);甘肃省教育厅科研基金(0712-02)
- 【文献出处】 兰州理工大学学报 ,Journal of Lanzhou University of Technology , 编辑部邮箱 ,2008年01期
- 【分类号】TP301.6
- 【被引频次】1
- 【下载频次】146