Checking of timing constraint violation based on graph in reactive systems

作     者：Kobayashi, H 

作者机构：Tokai Univ Detp Informat Med Technol Hiratsuka Kanagawa 2591292 Japan 

出 版 物：《IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES》 (IEICE Trans Fund Electron Commun Comput Sci)

年 卷 期：2002年第E85A卷第4期

页      面：909-913页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：timing constraint violation constraint graph Rea Time Logic Floyd-Warshall algorithm 

摘      要：The detection of tinting constraint violation is crucial in reactive systems. A method of detecting deadline violation based on Floyd-Warshall shortest path algorithm has been proposed by Chudrow et al. We extend this method to detect the violation of minimum delay time in reactive systems where the repetition of event sequences frequently occurs.