Open Access
The full-decomposition of sequential machines with the separate realization of the next-state and output functions
TLDR
A special full-decomposition strategy is investigated, which has several advantages comparing to the case where a sequential machine is considered as a unit, and can be directly used in order to develope programs computing different sorts of decompositions for sequential machines.Abstract:
The decomposition theory of sequential machines aims to find answers to the following important practical problem: how to decompose a complex sequential machine into a number of simpler partial machines in order to: simplify the design, implementation and verification process; make it possible to process (to optimize, to implement, to test, ••. ) the separate partial machines al though it may be impossible to process the whole machine with existing tools; make it possible to implement the machine with existing building blocks or inside of a limited silicon area. For many years, decomposition of the internal states of sequential machines has been investigated. Here, decomposition of the states, as well as, the inputs and outputs of sequential machines is considered, i.e. full-decomposition. In [16], classification of full-decompositions is presented and theorems about the existence of different full-decompositions are provided. In this report a special full-decomposition strategy is investigated the full-decomposition of sequential machines with the separate realization of the next-state and output functions. This strategy has several advantages comparing to the case where a sequential machine is considered as a unit. In the report, the results of theoretical investigations are presented; however, the notions and theorems provided here have straightforward practical interpretations and they can be directly used in order to develope programs computing different sorts of decompositions for sequential machines. INDEX TERMS Automata theory, decomposition, logic system design, sequential machines. ACKNOWLEDGEMENTS The author is indebted to Prof. ir. A. Heetman and Prof. ir. M. P.J. Stevens for making it possible to perform this work, to Dr. P.R. Attwood for making corrections to the English text and to mr. C. van de Watering for typing the text.read more
Citations
More filters
Journal ArticleDOI
General Decomposition and Its Use in Digital Circuit Synthesis
TL;DR: The fundamentals of a logic design methodology which meets the requirements of today's complex circuits and modem building blocks are presented and the decomposition methodology that is presented ensures “correctness by construction” and enables very effective and efficient post-factum validation.
Journal ArticleDOI
An efficient for the sequential general decomposition of sequential machines
Lech Jóźwiak,J.C. Kolsteren +1 more
TL;DR: A heuristic method is presented for suboptimal multiple-objective sequential general decomposition of sequential machines into submachines with limited input/output bits, product terms and state variables and shows that it is efficient and flexible.
Journal ArticleDOI
Simultaneous decompositions of sequential machines
TL;DR: The theoretical and practical results that were obtained in the field of simultaneous decompositions which divide the process described by a given sequential machine into a number of interacting parallel partial processes, each implemented by one partial machine are described.
A possibility to incorporate saturation in the simple, global model of a synchronous machine with rectifier
TL;DR: A possible way of extending the machine model with saturation is described, starting with the derivation of the separate models of the synchronous machine and the rectifier, a steady-state model and a dynamic model are derived.
Toward the development of an intelligent alarm system in anesthesia
TL;DR: Algorithms that can extract features from the individual waveforms and encode the results were developed and can be used by an expert system to identify clusters of malfunctions in the breathing system.
References
More filters
Book ChapterDOI
The Algebraic Theory of Automata
TL;DR: The aim of this chapter is to introduce the reader to the theory of discrete information processing systems (automata) and to develop an algebraic framework within which to talk about their complexity.
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
Pair algebra and its application to automata theory
Journal ArticleDOI
Some dangers in state reduction of sequential machines
TL;DR: It is shown that state reduction can destroy realizations of a given sequential machine from sets of smaller machines and thus lead to a sequential machine that is harder to realize.