Memory components handbook, 1988
Memory components handbook, 1988
Introduction to algorithms
Coherence and satisfiability of waveform timing specifications
Coherence and satisfiability of waveform timing specifications
Interface timing verification with application to synthesis
DAC '94 Proceedings of the 31st annual Design Automation Conference
Optimization of linear max-plus systems with application to timing analysis
Optimization of linear max-plus systems with application to timing analysis
Min-max linear programming and the timing analysis of digital circuits
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Scheduling for Reactive Real-Time Systems
IEEE Micro
Algorithms for Interface Timing Verification
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Synthesis of Timed Asynchronous Circuits
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Linear Programming for Optimum Hazard Elimination in Asynchronous Circuits
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Performance estimation for real-time distributed embedded systems
ICCD '95 Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors
Min-Max Inequalities and the Timing Verification Problem with Max and Linear Constraints
Discrete Event Dynamic Systems
Reasoning about synchronization in GALS systems
Formal Methods in System Design
Time separations of cyclic event rule systems with min-max timing constraints
Theoretical Computer Science
Scenario-based timing verification of multiprocessor embedded applications
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
This paper presents algorithms for computing separations between events that are constrained to obey prespecified relationships in their relative time of occurrence. The algorithms are useful for interface timing verification, where event separations are checked against timing requirements. The first algorithm computes separations when only linear and max constraints exist. The algorithm must converge to correct maximum separation values in a finite number of steps, or report an inconsistence of the constraints, irrespective of the existence of infinite constraint bounds or infinite event separations. It is conjectured to run in O(V E + V^2 log V) time, where V is the number of events, and E is the number of relationships between them. The other algorithms extend the first, and compute event separations in the NP-complete version of the problem where min constraints exist. Experiments demonstrate the algorithms are efficient in practice.