This paper presents a new formalism and a new algorithm for verifying timed circuits. The formalism, called orbital nets, allows hierarchical verification based on a behavioral semantics of timed trace theory. We present improvements to a geometric timing algorithm that take advantage of concurrency by using partial orders to reduce the time and space requirements of verification. This algorithm has been fully automated and incorporated into a design system for timed circuits, and experimental results demonstrate that this verification algorithm is practical for realistic examples.
CITATION STYLE
Rokicki, T. G., & Myers, C. J. (1994). Automatic verification of timed circuits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 818 LNCS, pp. 468–480). Springer Verlag. https://doi.org/10.1007/3-540-58179-0_76
Mendeley helps you to discover research relevant for your work.