Thumbnail
Access Restriction
Subscribed

Author Mowle, Frederic J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1970
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A sequential network is said to be controllable if there exists at least one integer $\textit{k}$ such that it is possible to transition between any pair of arbitrary states $(\textit{S}α,$ $\textit{S}β)$ in exactly $\textit{k}$ steps. In this paper, necessary and sufficient conditions are given for a nonlinear sequential network to be controllable. Strong connectedness is a necessary condition for controllability. It is shown that the existence of two cycles $\textit{C}1$ and $\textit{C}2$ on a strongly connected sequential network, whose cycle lengths $\textit{L}1$ and $\textit{L}2$ are relatively prime, is both necessary and sufficient for controllability. Simple test procedures are also developed which determine if a sequential network is controllable and which determine the transition sequences.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1970-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 17
Issue Number 3
Page Count 7
Starting Page 518
Ending Page 524


Open content in new tab

   Open content in new tab
Source: ACM Digital Library