An algorithm to determine shortest length distinguishing, homing, and synchronizing sequences for sequential machines

The objective of this paper is to analyze the behavior of sequential machines by experimental means. Experiments are concerned with state-identification to identify the initial and final state of the machine. A computer program is developed which accepts, as input, a state table of Mealy type (any n...

Full description

Saved in:
Bibliographic Details
Published inConference Record Southcon pp. 496 - 501
Main Authors Deshmukh, R.G., Hawat, G.N.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1994
Subjects
Automata
Binary trees
Clocks
Educational institutions
Flip-flops
Input variables
Mathematical model
Pulse circuits
Sequential circuits
Synchronization
Online AccessGet full text

Cover

More Information
Summary:The objective of this paper is to analyze the behavior of sequential machines by experimental means. Experiments are concerned with state-identification to identify the initial and final state of the machine. A computer program is developed which accepts, as input, a state table of Mealy type (any number of states) machine and builds the successor trees and finds the minimized distinguishing, homing, and synchronizing sequences. The program identifies the levels of the nodes and also lists all groups at each successor node of the tree. Additionally, flags are set when a terminal node is reached or a solution is obtained. The program, written in Pascal, is executed on the Vax 11/780 computer.
ISBN:0780399889
9780780399884
DOI:10.1109/SOUTHC.1994.498154