Theoretical Computer Science
Symbolic timing verification of timing diagrams using Presburger formulas
DAC '97 Proceedings of the 34th annual Design Automation Conference
Verification of timed circuits with symbolic delays
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Verification of the generic architecture of a memory circuit using parametric timed automata
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Timed state space exploration using POSETs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Lazy transition systems and asynchronous circuit synthesis with relative timing assumptions
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An Inverse Method for Parametric Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The problem of ''time separation'' can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, what is the maximum time for traversing the global system? This problem is useful, e.g. in the domain of digital circuits, for determining the global traversal time of a signal from the knowledge of bounds on the component propagation delays. The uncertainty on each component delay is given under the form of an interval. The general problem is NP-complete. We focus here on the inverse problem: we seek intervals for component delays for which the global traversal time is guaranteed to be no greater than a specified maximum. We give a polynomial time method to solve it. As a typical application, we show how to use the method in order to relax some specified local delays while preserving the maximum traversal time. This is especially useful, in the area of digital circuits, for optimizing ''setup'' timings of input signals (minimum timings required for stability).