In this chapter, we present timing constraint abstraction and analysis techniques. The primary objective of constraint analysis is to examine the mutual consistency of timing constraints and to answer the question about the existence of a system implementation that would satisfy the timing constraints. This analysis assumes that any constraints on availability of hardware resources have already been resolved as additional control dependencies in the flow graph model. Therefore, the available concurrency in the flow graph model can indeed be supported by the available hardware.
KeywordsEntropy Posite Convolution Nite
Unable to display preview. Download preview PDF.