Specification and analysis of timing constraints in signal transition graphs

The introduction of timing constraints in signal transition graphs (STG) is discussed. The possible interpretations of these timing constraints (called the firing semantics) is also discussed. During synthesis it is an important task to calculate the minimum and maximum distance in time between two transitions based on timing information present in the STG. A new recursive algorithm that calculates this time difference is presented. It takes into account some of the firing semantics introduced before. The algorithm finds the correct result for acyclic graphs in a quadratic worst case running time.<>