Checking of Timing Constraint Violation Based on Graph in Reactive Systems

Hiromi KOBAYASHI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E85-A   No.4   pp.909-913
Publication Date: 2002/04/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Graphs and Networks
Keyword: 
timing constraint violation,  constraint graph,  Real Time Logic,  Floyd-Warshall algorithm,  

Full Text: PDF>>
Buy this Article




Summary: 
The detection of timing constraint violation is crucial in reactive systems. A method of detecting deadline violation based on Floyd-Warshall shortest path algorithm has been proposed by Chodrow 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.