Skip to main content
Log in

The stabilization test for pipelines

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. H. T. Kung, “The structure of parallel algorithms,”Adv. Comp.,19, 65–112 (1980).

    Google Scholar 

  2. V. B. Kudrjavcev, S. V. Aljeshin, and A. S. Podkolzin,Introduction to Automata Theory [in Russian], Nauka, Moscow (1985).

    Google Scholar 

  3. K. V. Shakhbazjan, “On the representation of processes in graphs,”Sov. Math. Dokl.,10, No. 2 (1990).

    Google Scholar 

  4. K. V. Shakhbazjan, “On the algebra of processes in graphs,”Kibernetika,6, 38–42 (1998).

    Google Scholar 

Download references

Authors

Additional information

Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 248, 1998, pp. 187–204.

Translated by K. V. Shakhbazjan

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02672776

Keywords

Navigation