The full-decomposition of sequential machines with the separate realization of the next-state and output functions
01 Jan 1989-
TL;DR: 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.
Citations
More filters
••
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.
Abstract: Modem microelectronic technology.gives opportunities to build digital circuits of huge complexity and provides a wide diversity of logic building blocks. Although logic designers have been building circuits for many years, they have realized that advances in microelectronic technology are outstripping their abilities to make use of the created opportunities. In this paper, we present the fundamentals of a logic design methodology which meets the requirements of today's complex circuits and modem building blocks. The methodology is based on the theory of general full-decompositions which constitutes the theory of digital circuit structures at the highest abstraction level. The paper explains the theory and shows how it can be used for digital circuit synthesis. The decomposition methodology that is presented ensures “correctness by construction” and enables very effective and efficient post-factum validation. It makes possible extensive examination of the structural features of the required information processing in relation to a given set of objectives and constraints.
46 citations
Cites background from "The full-decomposition of sequentia..."
...8); decompositions with the separate realization of the next-state and output functions [24] (Fig....
[...]
••
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.
22 citations
••
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.
18 citations
01 Sep 1989
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.
Abstract: In the global, rather simple model of the synchronous machine with rectifier developed before, saturation phenomena were not taken into account. Here, 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. The dynamic model is a global model, in which very fast phenomena, such as the ripple on the direct current, are neglected. Hoeijrnakers, M,J. A POSSIBLITY TO INCORPORATE SATURATION IN THE SIMPLE, GLOBAL MODEL OF THE SYNCHRONOUS MACHINE WITH RECTIFIER. Faculty of Electrical Engineering, Eindhoven University of Technology, The Netherlands, 1989. EUT Report 89-E-225 Address of the author Dr.ir. M.J. Hoeijmakers, Electromechanics and Power Electronics, Faculty of Electrical Engineering, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
11 citations
01 Jan 1989
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.
Abstract: Abnormal and potentially hazardous fault conditions in the anesthesia breathing system include leaks. obstructions. disconnects and incompetent valves. The capnogram. airway pressure and airway flow waveforms measured close to the patient's mouth were recorded during a number of fault conditions to find all features that describe these cases. Algorithms that can extract these features from the individual waveforms and encode the results were developed. With the features' code it is possible to to describe problems in the breathing system. Finally. a method to automatically detect malfunctions in the breathing system is described. The features' code and this method can be used by an expert system to identify clusters of malfunctions in the breathing system.
10 citations
References
More filters
•
01 Jan 1966
571 citations
"The full-decomposition of sequentia..." refers background or methods in this paper
...In order to analyze the information flow inside and between the state machines, the partition and partition pairs concepts, introduced by Hartmanis [11][12], are used here....
[...]
...For many years, decomposition of the internal states of sequential machines has [2][3][8][9][11][12][13][17] •....
[...]
•
01 Jan 1982
TL;DR: In this paper, the holonomy decomposition is used to decompose semigroups and their relatives into machines and semiggroups, and their relation to semigroup decompositions.
Abstract: Introduction 1 Semigroups and their relatives 2 Machines and semigroups 3 Decompositions 4 The holonomy decomposition 5 Recognizers 6 Sequential machines and functions Appendix References Index of notation Index
174 citations
"The full-decomposition of sequentia..." refers background in this paper
...For many years, decomposition of the internal states of sequential machines has [2][3][8][9][11][12][13][17] •....
[...]
••
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.
Abstract: In this paper, the problem of determining economical state assignments for finite-state sequential machines is studied. The fundamental idea in this study is to find methods for selection of these assignments in which each binary variable describing the new state depends on as few variables of the old state as possible. In general, these variable assignments in which the dependence is reduced yield more economical implementation for the sequential machine than the assignments in which the dependence is not reduced. The main tool used in this study is the partition with the substitution property on the set of states of a sequential machine. It is shown that for a sequential machine the existence of assignments with reduced dependence is very closely connected with the existence of partitions with the substitution property on the set of states of the machine. It is shown how to determine these partitions for a given sequential machine and how they can be used to obtain assignments with reduced dependence.
152 citations