Checking of Timing Constraint Violation Based on Graph in Reactive Systems
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.4 pp.909-913
- Publication Date
- 2002/04/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiromi KOBAYASHI, "Checking of Timing Constraint Violation Based on Graph in Reactive Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 4, pp. 909-913, April 2002, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_4_909/_p
Copy
@ARTICLE{e85-a_4_909,
author={Hiromi KOBAYASHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Checking of Timing Constraint Violation Based on Graph in Reactive Systems},
year={2002},
volume={E85-A},
number={4},
pages={909-913},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Checking of Timing Constraint Violation Based on Graph in Reactive Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 909
EP - 913
AU - Hiromi KOBAYASHI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2002
AB - 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.
ER -
English
