Name
Abstract | ||
|---|---|---|
As real time applications become more complex and distributed, monitoring for timing constraint compliance becomes more important in facilitating the enforcement of conditional guarantees and for recovery purposes. C.E. Chodrow et al. (1991) described a O(n/sup 3/) satisfiability checking algorithm for timing constraint monitoring at each check point, where n is the number of time terms in the timing constraint specification. We show that a timing violation can be caught as early as possible by deriving and monitoring a minimum set of timing constraints from the timing constraint specification. We show that only O(n) time is needed in the worst case for checking at each check point. An implementation based on the results reported herein appears in a companion paper (A.K. Mok and G. Liu, 1997). |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/REAL.1997.641280 | RTSS |
Keywords | Field | DocType |
timing constraint monitoring,g. liu,time term,check point,early detection,real time application,timing violation,timing constraint compliance,timing constraint,timing constraint violation,satisfiability checking algorithm,timing constraint specification,computability,real time systems,formal specification,satisfiability,computational complexity | Upper and lower bounds,Computer science,Satisfiability,Algorithm,Term (time),Real-time computing,Computability,Formal specification,Condition monitoring,Application software,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1052-8725 | 0-8186-8268-X | 26 |
PageRank | References | Authors |
2.67 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aloysius K. Mok | 1 | 662 | 86.52 |
| G. Liu | 2 | 26 | 2.67 |