A set of algorithms to reduce the size of timed finite state graphs are presented. In particular, we develop a more general algorithm for vertex folding than those presently existing. It is based on the law of conservation of transition time. We demonstrate the application of these reduction algorithms to a version of the stop-and-wait protocol.
rnWe have also developed a graph reduction software package incorporating all these algorithms which can be used in automated performance prediction. Graph reduction software tools such as these are important and form an integral part of automated protocol performance prediction tools[RUD 83].
我们还开发了一种包含所有这些算法的图归约软件包,可用于自动性能预测。诸如此类的图形约简软件工具非常重要,它们构成了自动化协议性能预测工具的组成部分[RUD 83]。 P>
Univ. of Ottawa, Ontario, Canada;
机译:关于断开式数字式切换动态网络的有限时间和定期共识算法
机译:标准和高阶有限差分时域算法的简化图形处理器加速
机译:标准和高阶有限差分时域算法的简化图形处理器加速
机译:一种时域分层有限元减少恢复(Lafe-RR)方法的线性复杂度恢复算法,用于高速IC的大规模电磁分析
机译:使用金属假象减少(MAR)算法和双能计算机断层扫描(CT)方法进行金属假象减少的剂量学评估。
机译:实时虚拟支架算法的有限元分析与遗传算法比较与标定
机译:关于断开式数字式动态网络的有限时间和定期共识算法
机译:高性能并行计算机上有限差分时域,有限元时域和平面广义Yee算法性能的比较