For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Checking of Timing Constraint Violation Based on Graph in Reactive Systems
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/04/01
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Graphs and Networks
timing constraint violation, constraint graph, Real Time Logic, Floyd-Warshall algorithm,
Full Text: PDF>>
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.