[Paper Review] Towards a Mathematical Theory of the Delays of the Asynchronous Circuits

Serban E. Vlad|ArXiv.org|Feb 17, 2004

Embedded Systems Design Techniques8 references3 citations

TL;DR

This paper proposes a mathematical framework for modeling delays in asynchronous circuits using pseudo-Boolean differential calculus, aiming to formalize a semi-structured theory for digital electrical engineering. The key contribution is the derivation of delay inequations that capture timing behavior in a logically rigorous way, laying groundwork for formal verification of circuit correctness.

ABSTRACT

The inequations of the delays of the asynchronous circuits are written, by making use of pseudo-Boolean differential calculus. We consider these efforts to be a possible starting point in the semi-formalized reconstruction of the digital electrical engineering (which is a non-formalized theory).

Motivation & Objective

• To address the lack of formal mathematical treatment in digital electrical engineering, particularly for asynchronous circuits.
• To model timing behavior in asynchronous circuits with rigorous mathematical tools.
• To develop a semi-formalized theory that can support formal verification of circuit designs.
• To establish a foundation for the systematic analysis of delays in non-synchronous digital systems.

Proposed method

• The paper employs pseudo-Boolean differential calculus to derive delay inequations for asynchronous circuits.
• It models signal propagation and timing constraints using algebraic expressions over Boolean variables.
• The approach formulates delay constraints as inequalities involving Boolean functions and their derivatives.
• The calculus framework allows for the expression of timing dependencies in a differentiable and analyzable form.
• The method integrates logical structure with timing behavior through differential operators on Boolean functions.
• The resulting inequations describe the minimal and maximal delays across circuit paths.

Experimental results

Research questions

• RQ1 How can delay behavior in asynchronous circuits be formally expressed using mathematical logic?
• RQ2 What algebraic framework enables the derivation of timing constraints in non-synchronous digital systems?
• RQ3 Can pseudo-Boolean differential calculus provide a rigorous basis for modeling propagation delays?
• RQ4 How can such a formalism support the verification of circuit correctness?
• RQ5 What is the role of differential operators in modeling signal transitions in Boolean circuits?

Key findings

• The paper successfully formulates delay constraints in asynchronous circuits as inequations using pseudo-Boolean differential calculus.
• The derived inequations capture both minimal and maximal propagation delays across circuit paths.
• The method provides a semi-formalized mathematical language for analyzing timing behavior in digital circuits.
• The framework enables the systematic expression of timing dependencies in a logically consistent manner.
• The approach offers a pathway toward formal verification of asynchronous circuit designs.
• The theory is grounded in a prior publication in the Analele Universitatii din Oradea, indicating peer-reviewed validation.