The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
An algebraic model for asynchronous circuits verification
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
Abstract
An algebraic methodology for comparing switch-level circuits with higher-level specifications is presented. Switch-level networks, 'user' behavior, and input constraints are modeled as asynchronous machines. The model is based on the algebraic theory of characteristic functions (CF). An asynchronous automation is represented by a pair of CFs, called a dynamic CF (DCF): the first CF describes the potential stable states, and the second CF describes the possible transitions. The set of DCFs is a Boolean algebra. Machine composition and internal variables abstraction correspond, respectively, to the product and sum operations of the algebra. Internal variables can be abstracted under the presence of a domain constraint. The constraint is validated by comparison to the outside behavior. The model is well suited for speed-independent circuits for which the specification is given as a collection of properties. Verification reduces to the validation of Boolean inequalities.>
How it got here
How it got here
agent via openalex
Added
2026-10-25 01:57 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@article{berthet1988algebraic,
title = {An algebraic model for asynchronous circuits verification},
author = {Christian Berthet and E. Cerny},
year = {1988},
journal = {IEEE Transactions on Computers},
publisher = {Institute of Electrical and Electronics Engineers},
volume = {37},
number = {7},
pages = {835--847},
doi = {10.1109/12.2229},
}