The design of self-checking systems is a viable approach for coping with critical applications, guaranteeing the on-line detection of a fault as soon as it causes an erroneous behavior. The aim of this paper is the dejnition of a design strategy for sequential circuits, starting from their description in terms of Finite State Machines. The attention is focused on a constant distance code and state encoding technique which provide, together with a traditional Berger encoding of the outputs, a self-checking system. Benchmark results and a comparison with other approaches are presented to evaluate the quality of the proposed methodology
ISBN: 0897915771The authors point out that the synthesis of single fault tolerant finite-state machi...
State space exploration of finite state machines is used to prove properties about sequential behavi...
ISBN: 0080348017Theoretical developments and practical applications of self-checking circuits are pr...
The design of self-checking systems is a viable approach for coping with critical applications, guar...
The design of self-checking FSMs can be achieved by adopting an encoding for the state, for the outp...
This paper presents a complete methodology to design a totally self-checking (TSC) sequential system...
A new methodology for defining self-checking sequential architectures is presented in the paper. A m...
The paper presents the design methodology for realizing Totally Self-Checking checkers for a code ba...
A method of a self-checking synchronous Finite State Machine (FSM) network design with low overhead ...
Due to reduction in device feature size and supply voltages the probability of soft-errors in Finite...
Abstract-Self-checking circuits can detect the presence of both transient and permanent faults. A se...
Abstract—In digital sequential systems that operate over several time steps, a state-transition faul...
Abstract-The paper discuses a new approach for designing self-checking sequential circuits with smoo...
State space exploration is often used to prove properties about sequential behavior of Finite State ...
ISBN: 0818638303The theory of digital self-checking circuits has been developed in order to make for...
ISBN: 0897915771The authors point out that the synthesis of single fault tolerant finite-state machi...
State space exploration of finite state machines is used to prove properties about sequential behavi...
ISBN: 0080348017Theoretical developments and practical applications of self-checking circuits are pr...
The design of self-checking systems is a viable approach for coping with critical applications, guar...
The design of self-checking FSMs can be achieved by adopting an encoding for the state, for the outp...
This paper presents a complete methodology to design a totally self-checking (TSC) sequential system...
A new methodology for defining self-checking sequential architectures is presented in the paper. A m...
The paper presents the design methodology for realizing Totally Self-Checking checkers for a code ba...
A method of a self-checking synchronous Finite State Machine (FSM) network design with low overhead ...
Due to reduction in device feature size and supply voltages the probability of soft-errors in Finite...
Abstract-Self-checking circuits can detect the presence of both transient and permanent faults. A se...
Abstract—In digital sequential systems that operate over several time steps, a state-transition faul...
Abstract-The paper discuses a new approach for designing self-checking sequential circuits with smoo...
State space exploration is often used to prove properties about sequential behavior of Finite State ...
ISBN: 0818638303The theory of digital self-checking circuits has been developed in order to make for...
ISBN: 0897915771The authors point out that the synthesis of single fault tolerant finite-state machi...
State space exploration of finite state machines is used to prove properties about sequential behavi...
ISBN: 0080348017Theoretical developments and practical applications of self-checking circuits are pr...