Abstract
Purchase PDF (841 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (1727 K)
doi:10.1016/0045-7906(86)90008-X 
Copyright © 1986 Published by Elsevier Science Ltd.
Further studies on the matrix approach to the measurement and control problems of synchronous sequential machines— Performance evaluation by computer simulation and application of specific heuristics*1
Available online 13 February 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The sequential machine is a well-established model for discrete information processing devices and systems. Under many circumstances, it is necessary to identify the state of the machine. Usually an appropriate sequence of input symbols is found and fed the machine; then, based on the corresponding output sequence, the state is determined. The major problem lies in finding the input sequence for the experiment. The usual approach to solve this problem is to use the response tree in conjunction with the transition table of the machine under consideration, then determine the growth and truncation of each branch according to a set of rules which necessitates comparison with each existing node. The answer is eventually reached through complying with certain rules. In general, the comparison process is slow and wasteful and there is no way of controlling computing space; also, there is no framework to implement fast solution techniques. In this paper, in order to solve the same problem, the concept of transition table is extended, operations are defined, and, in order to solve the problem quickly, some techniques and heuristics are introduced. This proposed approach can save a lot of computing time and memory space.
