Verification of timed circuits with symbolic delays
Year: 2005
Type: conference-paper
Abstract: Verifying timed circuits is a complex problem even when the delays of the system are fixed. This paper deals with a more challenging problem, the formal verification of timed circuits with unspecified delays represented as symbols. The approach discovers a set of sufficient linear constraints on the symbols that guarantee the correctness of the circuit. Experimental results from the area of asynchronous circuits show the applicability of the approach.
Authors: R. Clariso, J. Cortadella
Institution: Universitat Politècnica de Catalunya
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Generalitat de Catalunya
OpenAlex ID: W4241409135
