Completely self-checking asynchronous combinational circuits and the indicability property

The paper is concerned with completely self-checking asynchronous combinational circuits. Asynchronous combinational circuits which feature indicability are shown to be completely self-checking. The necessary and sufficient conditions for indicability of asynchronous combinational circuits are found. Deal-beat circuits are shown to feature indicability. In this way technical diagnostics is related with theory of aperiodic automata.