Reasoning about timing behavior of digital circuits using symbolic event propagation and temporal logic

Present-day designers require deep reasoning methods to analyze circuit timing. This includes analysis of effects of dynamic behavior (like glitches) on critical paths, simultaneous switching, and identification of specific patterns and their timings. This paper proposes a novel approach that uses a combination of symbolic event propagation and temporal reasoning to extract timing properties of gate-level circuits. The formulation captures the complex situations like triggering of traditional false paths and simultaneous switching in a unified symbolic representation in addition to identifying false paths, critical paths, as well as conditions for such situations. This information is then represented as an event-time graph. A temporal logic on events is proposed that can be used to formulate a wide class of useful queries for various input scenarios. These include maximum/minimum delays, transition times, duration of patterns, etc. An algorithm is developed that retrieves answers to such queries from the event-time graph. A binary decision diagram-based implementation of this system has been made. Results on the International Symposium on Circuits and Systems (ISCAS)85 benchmarks are presented

[1]  Stephan Merz,et al.  Model Checking , 2000 .

[2]  Steven M. Nowick,et al.  Fast hazard detection in combinational circuits , 2004, Proceedings. 41st Design Automation Conference, 2004..

[3]  Joao Marques-Silva,et al.  Satisfiability models and algorithms for circuit delay computation , 2002, TODE.

[4]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[5]  Sharad Malik,et al.  Certified timing verification and the transition delay of a logic circuit , 1992, DAC '92.

[6]  Enrico Macii,et al.  Timing analysis of combinational circuits using ADDs , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.

[7]  Steven M. Nowick,et al.  An introduction to asynchronous circuit design , 1998 .

[8]  Hakan Yalcin.  Hierarchical timing analysis of digital circuits , 1997 .

[9]  John P. Hayes,et al.  An approximate timing analysis method for datapath circuits , 1996, Proceedings of International Conference on Computer Aided Design.

[10]  David Hung-Chang Du,et al.  Path sensitization in critical path problem [logic circuit design] , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  John P. Hayes,et al.  Event propagation conditions in circuit delay computation , 1997, TODE.

[12]  David S. Kung.  Hazard-non-increasing gate-level optimization algorithms , 1992, ICCAD.

[13]  Robert K. Brayton,et al.  Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network , 1989, 26th ACM/IEEE Design Automation Conference.

[14]  Spyros Tragoudas,et al.  Generation of hazard identification functions , 2003, Fourth International Symposium on Quality Electronic Design, 2003. Proceedings..

[15]  Jyuo-Min Shyu,et al.  A new approach to solving false path problem in timing analysis , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[16]  Nagisa Ishiura,et al.  Time-Symbolic Simulation for Accurate Timing Verification of Asynchronous Behavior of Logic Circuits , 1989, 26th ACM/IEEE Design Automation Conference.

[17]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[18]  David Hung-Chang Du,et al.  On the General False Path Problem in Timing Analysis , 1989, 26th ACM/IEEE Design Automation Conference.

[19]  John P. Hayes,et al.  Hierarchical timing analysis using conditional delays , 1995, ICCAD.

[20]  Melvin A. Breuer,et al.  A new gate delay model for simultaneous switching and its applications , 2001, DAC '01.

[21]  David Hung-Chang Du,et al.  Path sensitization in critical path problem , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.