This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Self-Diagnosing Cellular Implementations of Finite-State Machines
December 1981 (vol. 30 no. 12)
pp. 953-959
S.M. Walters, Bell Laboratories
Cellular spaces are shown to possess properties favorable to reconfiguration. As a first step in the direction of reconfigurable cellular spaces, this paper demonstrates the implementation of arbitrary finite-state machines in self-diagnosing cellular spaces. The results cover single cell failures caused by erroneous state transitions or by erroneous outputs. One of the attractive features of the implementation is the absence of any hard core components. As an intermediate step, it is shown how to transform any given cellular space into a self-diagnosing cellular space. The results demonstrate that the control structure (which is a finite-state machine) of any computing device can be implemented as a self-diagnosing entity without hard core.
Index Terms:
tessellation automata, Decomposition for diagnosability, design for diagnosability, fault detection, finite-state machines
Citation:
S.M. Walters, F.G. Gray, R.A. Thompson, "Self-Diagnosing Cellular Implementations of Finite-State Machines," IEEE Transactions on Computers, vol. 30, no. 12, pp. 953-959, Dec. 1981, doi:10.1109/TC.1981.1675734
Usage of this product signifies your acceptance of the Terms of Use.