Performance analysis and optimization of asynchronous circuits
Performance analysis and optimization of asynchronous circuits
Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Bounded Delay Timing Analysis of a Class of CSP Programs
Formal Methods in System Design
Semantics and verification of action diagrams with linear timing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems
IEEE Transactions on Computers
Maximum Time Separation of Events in Cyclic Systems with Linear and Latest Timing Constraints
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Interface Timing Verification with Delay Correlation Using Constraint Logic Programming
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Maximum Time Separation of Events in Cyclic Systems with Linear and Latest Timing Constraints
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
An efficient algorithm for time separation of events in concurrent systems
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
The determination of the maximum time separations of events is important in the design, synthesis, and verification of digital systems, especially in interface timing verification. Many researchers have explored solutions to the problem with various restrictions: a) on the type of constraints, and b) on whether the events in the specification are allowed to occur repeatedly. When the events can occur only once, the problem is well solved. There are fewer concrete results for systems where the events can occur repeatedly. We extend the work by Hulgaard et al. for computing the maximum separation of events in cyclic constraint graphs with latest constraints to constraint graphs with both linear and latest constraints.