No abstract

No abstract

A ternary algebra is a De Morgan algebra (that is, a distributive lattice with 0 and 1 and a complement operation that satisfies De Morgan's laws) with an additional constant Φ satisfying [Formula: see text], [Formula: see text], and [Formula: see text]. We provide a characterization of finite ternary algebras in terms of "subset-pair algebras," whose elements are pairs (X, Y) of subsets of a given base set ℰ, which have the property X ∪ Y = ℰ, and whose operations are based on common set operations.

Abstract This paper addresses the problem of verifying pulse-mode asynchronous circuits, which combine advantages of different asynchronous design styles. A novel technique is proposed for constructing in a modular manner specifications and functional models of pulse-mode circuits. Case studies show the feasibility of formal verification on the basis of the proposed construction, integrated into an existing technique for verifying asynchronous circuits under relative timing constraints at several levels of abstraction.

No abstract