Performance analysis based on timing simulation
Christian D. Nielsen, Michael Kishinevsky · 1994
Determining the cycle time and a critical cycle is a fundamental problem in the analysis of concurrent systems.We solve this problem using timing simulation of an underlying Signal Graph (an extension of Marked Graphs).For a Signal Graph with n vertices and m arcs our algorithm has the polynomial time complexity O(b 2 m), where b is the number of vertices with initially marked in-arcs (typically bn).The algorithm has a clear semantic and a low descriptive complexity.We illustrate the use of the algorithm by applying it to performance analysis of asynchronous circuits.