Abstract
This paper considers the stabilization problem for pipelines. A pipeline is a network of functional units with one-pulse delay. The least upper bound for the length of the stabilization test, valid for a class of isomorphic pipelines, is obtained. An algorithm for constructing the result of the stabilization test is presented. Bibliography: 4 titles.
Similar content being viewed by others
References
H. T. Kung, “The structure of parallel algorithms,”Adv. Comp.,19, 65–112 (1980).
V. B. Kudrjavcev, S. V. Aljeshin, and A. S. Podkolzin,Introduction to Automata Theory [in Russian], Nauka, Moscow (1985).
K. V. Shakhbazjan, “On the representation of processes in graphs,”Sov. Math. Dokl.,10, No. 2 (1990).
K. V. Shakhbazjan, “On the algebra of processes in graphs,”Kibernetika,6, 38–42 (1998).
Additional information
Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 248, 1998, pp. 187–204.
Translated by K. V. Shakhbazjan
Rights and permissions
About this article
Cite this article
Shakhbazjan, K.V. The stabilization test for pipelines. J Math Sci 101, 3338–3347 (2000). https://doi.org/10.1007/BF02672776
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02672776