稠密时间表示及冗余消除-SemanticScholar.PDFVIP

1000-9825/2003/14(10)1681 ©2003 Journal of Software 软 件 学 报 Vol.14, No.10 ∗ 稠密时间表示及冗余消除 陈 靖+ ( 中国科学院 软件研究所 计算机科学重点实验室,北京 100080) Dense Time Representation and Redundancy Elimination CHEN Jing+ (Key Laboratory for Computer Science, Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China) + Corresponding author: Phn: 86- 10 Fax: 86-10 E-mail: chen@lifo.univ-orleans.fr Received 2002-09-03; Accepted 2003-04-14 Chen J. Dense time representation and redundancy elimination. Journal of Software, 2003,14(10):1681~1691. /1000-9825/14/1681.htm Abstract: The efficiency of an algorithm depends greatly on the data structure adopted in practice, while the processing of useless data can cause not only much waste of memory but also much waste of time. Hence to eliminate redundant information is one of the main focuses in the research of algorithms, and the issue has received extensive attention in real-time field (especially those based on dense/continuous time semantics) for many years. After investigating existing problems in finite representation and operations, and by analyzing the dependence relation in information, a method is presented for eliminating redundant information in representation of dense time, which is developed based on an modification of the procedure of ‘Normalization’. The correctness of the method is proved and the efficiency is tested by experiences. Key words: real-time; timed automata; data structure; redundancy elimination; shortest path finding algorithm; optimization 摘 要: 算法的效率在很大程度上依赖于实际采用的数据结构.对无用数据的处理不仅会带来空间存储上的 浪费, 而且也会进一步造成时间上的浪费. 因此, 消除信息冗余一直是算法研究的一个重点.在当前实时领域(尤 其是在基于稠密/连续时间语义) 的算法研究中,该问题十分突出.从信息之间的依赖关系入手,分析了在对连续 时间进行有穷表示和操作中存在的问题,通过改进“ 范式化”处理过程,给出了