Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A graph-theoretic approach for timing analysis and its implementation
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
A more general algorithm for computing closed semiring costs between vertices of a directed graph
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Introduction to Algorithms
Efficient algorithms for debugging timing constraint violations
Proceedings of the 8th ACM/IEEE international workshop on Timing issues in the specification and synthesis of digital systems
Proceedings of the tenth international symposium on Hardware/software codesign
Efficient Run-Time Monitoring of Timing Constraints
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
The Monitoring of Timing Constraints on Time Intervals
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Timing Analysis of Embedded Real-Time Systems
Timing Analysis of Embedded Real-Time Systems
Algorithm Design
A causality interface for deadlock analysis in dataflow
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Faster Verification of RTL-Specified Systems via Decomposition and Constraint Extension
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
A Generic Framework for Monitoring Timing Constraints over Uncertain Events
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
A Programming Model for Time-Synchronized Distributed Real-Time Systems
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Monitoring of Timing Constraints with Confidence Threshold Requirements
IEEE Transactions on Computers
Interval-Based Timing Constraints Their Satisfactions and Applications
IEEE Transactions on Computers
Causality interfaces for actor networks
ACM Transactions on Embedded Computing Systems (TECS)
The Rationale for Time-Triggered Ethernet
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
A Metric for Judicious Relaxation of Timing Constraints in Soft Real-Time Systems
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Maintaining real-time application timing similarity for defect-tolerant NoC-based many-core systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
| Hi-index | 0.00 |
Real-time and embedded applications often involve different types of timing constraints, such as precedence constraints and real-time constraints. As real-time and embedded applications further advance, new timing constraint types are emerging as well. Recent research on interval-based timing constraints is an example. Thus, it is important to have a uniformed timing constraint representation so that a generalized approach can be developed to analyze the variant constraint types. A semiring-based timing constraint model is introduced to generalize the representations of different constraint types. Under this model, we develop an algorithm to check the satisfaction feasibility for a given set of semiring-based timing constraints. This algorithm provides better performance in the average case as compared to applying the Bellman-Ford algorithm directly on the constraint set. In addition, for a set of feasible semiring-based timing constraints, event occurrence points that satisfy the constraint set form a (hyperdimension) feasible region. For the given two sets of timing constraints, we develop a necessary and sufficient condition to testify whether the two constraint sets' feasible regions have an inclusion relation. If one feasible region is included in the other, we know that the real-time event occurrences that satisfy the included constraint set will necessarily satisfy the including set.