Asynchronous Circuit Design

Index

A

Absolute complement, 361

Absorbed, 167

Absorption, 188, 362

Acknowledge, 4, 57, 61

Actions, 116

Active, 6, 61

Adjacent, 87

Advance time, 271, 314

Adverse example, 280

AFSM, 89

See also asynchronous finite state machine

Aliases, 42

Allowed sequences, 208

See also trace

Always operator, 297

timed, 303

AMULET, 323

Antisymmetric, 360, 363

Arbiter, 340

Arbitration, 340

See also synchronization

Arc, 86

Architecture, 25

Assert statement, 59

Assign, 4, 59, 63

Associative, 188, 362

Asymmetric

choice nets, 108

confusion, 107

Asynchronous

circuit design

future?, 341

history, 322

finite state machines, 8, 88

handshake, 2

instruction-length decoder, 325

See also RAPPID

microprocessors, 323

AMULET, 323

Caltech, 323

pager, 324

timing, 2

Atomic gate, 225

implementation, 225

Attribute, 27

Autofailure, 309

manifestation, 308

Average-case

logic optimization, 327

performance analysis, 329

B

Base functions, 190

BCP algorithm, 134

See also covering problem

bounding, 137

branching, 138

example, 149

reduction, 135

termination, 137

Binary

decision diagram, 198

relations, 362

Binate covering problem, 133

Bipartite graph, 88

Blocks, 155

BM machines, 92

See also burst-mode

edge-labeling functions, 92

maximal set property, 92

state diagram, 92

unique entry point, 92

Boolean

matching, 191

matrix, 157

Bounded

delay, 14

gate and wire delay, 132

response time, 300

timing constraint, 118, 260

Bounding, 137

Branching, 138

Bridging fault model, 332

Buffer, 58

Bundled data, 61

Bundling constraint, 62

Burst-mode, ...