Abstract

A graph-based approach to the verification of timing constraints in timing diagrams is described. Timing diagrams as a specification tool together with a specialized theorem prover for inequalities are used to support the timing design process. The method for automatically proving the consistency of a designed timing diagram works over a graph representing the timing diagram and constraints. It is based on the detection of cycles in this graph. A simple extension of this method enables the generation of a set of timing constraints which have to be fulfilled in the given timing diagram.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.