Journal ArticleDOI
Optimization of Reduced Dependencies for Synchronous Sequential Machines
Peter Weiner,Edward J. Smith +1 more
Reads0
Chats0
TLDR
An algorithmic ``solution'' to the assignment problem of synchronous sequential machines is described, which can assign the input, state, and output symbols of a given machine so as to ``minimize'' the total logic.Abstract:
The purpose of this paper is to describe an algorithmic ``solution'' to the assignment problem of synchronous sequential machines. The figure of merit used provides a mathematical evaluation of the reduced dependencies that may exist in the set of logic equations. If desired, the algorithm can assign the input, state, and output symbols of a given machine so as to ``minimize'' the total logic, i.e., reduced dependencies of both the state and output logic on state and input variables are optimized. The method is nonenumerative in the sense that the first assignmnent found is optimal. A restricted version of the algorithm has been programmed for an IBM 7094 computer.read more
Citations
More filters
Journal ArticleDOI
Optimal State Assignment for Finite State Machines
TL;DR: The proposed algorithm for optimal state assignment is based on an innovative strategy: logic minimization of the combinational component of the finite state machine is applied before state encoding, and has been coded in a computer program, KISS, and tested on several examples of finite state machines.
Journal ArticleDOI
A Graph Model for Fault-Tolerant Computing Systems
TL;DR: An approach to fault-tolerant design is described in which a computing system S and an algorithm A to be executed by S are both defined by graphs whose nodes represent computing facilities.
Journal ArticleDOI
Fault-Tolerant Computing—Concepts and Examples
TL;DR: A survey of architectural approaches to fault-tolerant design is conducted, emphasizing the basic concepts employed in the design of these systems, and the tradeoffs and alternatives available to the system designer in attempting to meet applications requirements.
Journal ArticleDOI
A Generalized Theory for System Level Diagnosis
TL;DR: A completely new generalization of the characterization problem in the system-level diagnosis area is developed and provides necessary and sufficient conditions for any fault-pattern of any size to be uniquely diagnosable, under the symmetric, and asymmetric invalidation models with or without the intermittent faults.
Journal ArticleDOI
Diagnosable Systems for Intermittent Faults
TL;DR: A procedure is given to determine the intermittent fault diagnosability of any given system and it is seen that in contrast to permanent fault diagnOSable systems, there exists only a single type of intermittent fault diagnostic system.
References
More filters
Journal ArticleDOI
On the State Assignment Problem for Sequential Machines II
TL;DR: In this paper, the problem of determining economical state assignments for finite-state sequential machines is studied and it is shown that for a sequential machine the existence of assignments with reduced dependence is very closely connected with theexistence of partitions with the substitution property on the set of states of the machine.
Journal ArticleDOI
The Coding of Internal States of Sequential Circuits
TL;DR: This paper considers the problem of economical assignment of codes to the internal states of sequential circuits, and develops methods to minimize both the number of gates and of gate inputs (diodes) required to realize a given sequential circuit.
Journal ArticleDOI
Loop-free structure of sequential machines
TL;DR: It is shown how the amount of information flowing between the component machines in a realization can be studied by means of partition pairs.
Journal ArticleDOI
Symbolic Analysis of a Decomposition of Information Processing Machines
TL;DR: This paper studies the problem of replacing (decomposing) a complex finite state sequential machine by several simpler ones which operate in parallel and yield the same result.