Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A protocol test generation procedure
Computer Networks and ISDN Systems
Introduction to the theory of neural computation
Introduction to the theory of neural computation
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Spectral transforms for large boolean functions with applications to technology mapping
DAC '93 Proceedings of the 30th international Design Automation Conference
Testability of artificial neural networks: a behavioral approach
Journal of Electronic Testing: Theory and Applications
FsmTest: functional test generation for sequential circuits
Integration, the VLSI Journal
Protocol Conformance Testing Using Multiple UIO Sequences
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Hi-index | 0.00 |
Testability analysis and test pattern generation for neural architectures can be performed at a very high abstraction level on the computational paradigm. In this paper, we consider the case of Hopfield's networks, as the simplest example of networks with feedback loops. A behavioral error model based on finite-state machines (FSM's) is introduced. Conditions for controllability, observability and global testability are derived to verify errors excitation and propagation to outputs. The proposed behavioral test pattern generator creates the minimum length test sequence for any digital implementation.