Automatic Abstraction for Verification of Timed Circuits and Systems

This paper presents a new approach for verification of asynchronous circuits by using automatic abstraction. It attacks the state explosion problem by avoiding the generation of a flat state space for the whole design. Instead, it breaks the design into blocks and conducts verification on each of them. Using this approach, the speed of verification improves dramatically.

[1]  Tomohiro Yoneda,et al.  Timed trace theoretic verification using partial order reduction , 1999, Proceedings. Fifth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[2]  Jacob A. Abraham,et al.  Abstraction Techniques for Validation Coverage Analysis and Test Generation , 1998, IEEE Trans. Computers.

[3]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[4]  Rajeev Alur,et al.  Efficient Reachability Analysis of Hierarchical Reactive Machines , 2000, CAV.

[5]  Jun Gu,et al.  Asynchronous circuit synthesis with Boolean satisfiability , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Robert K. Brayton,et al.  Verifying Abstractions of Timed Systems , 1996, CONCUR.

[7]  Chris J. Myers,et al.  Improved POSET Timing Analysis in Timed Petri Nets , 2001 .

[8]  Ran Ginosar,et al.  RAPPID: an asynchronous instruction length decoder , 1999, Proceedings. Fifth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[9]  J. Burch.  Trace algebra for automatic verification of real-time concurrent systems , 1992 .

[10]  Michael Kishinevsky,et al.  Concurrent hardware : the theory and practice of self-timed design , 1993 .

[11]  Rajeev Alur,et al.  Timing Analysis in COSPAN , 1996, Hybrid Systems.

[12]  Peter A. Beerel,et al.  Efficient verification of determinate speed-independent circuits , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[13]  H. Peter Hofstee,et al.  Verification of delayed-reset domino circuits using ATACS , 1999, Proceedings. Fifth International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[14]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[15]  Ichiro Suzuki,et al.  A Method for Stepwise Refinement and Abstraction of Petri Nets , 1983, J. Comput. Syst. Sci..

[16]  Kevin J. Nowka,et al.  Designing for a gigahertz [guTS integer processor] , 1998, IEEE Micro.

[17]  Robert K. Brayton,et al.  STARI: A Case Study in Compositional and Hierarchical Timing Verification , 1997, CAV.

[18]  Chris J. Myers,et al.  Verification of Timed Systems Using POSETs , 1998, CAV.

[19]  Gérard Berthelot,et al.  Checking properties of nets using transformation , 1985, Applications and Theory in Petri Nets.

[20]  Tadao Murata,et al.  Additional methods for reduction and expansion of marked graphs , 1981 .

[21]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[22]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[23]  Jon K. Lexau,et al.  A FIFO ring performance experiment , 1997, Proceedings Third International Symposium on Advanced Research in Asynchronous Circuits and Systems.