Skip to main content
SpringerLink
Log in

Lattices of processes in graphs with inputs

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. K. V. Shakhbazyan, T. A. Tushkina, and M. M. Lebedinskii, “Issues of decomposition in pipelined computers” Zapiski Nauchnykh Seminarov LOMI,159, 47–55 (1987).

    Google Scholar 

  2. K. V. Shakhbazyan, “On the algebra of processes in graphs,” Kibernetika, No. 6, 38–42 (1988).

    MATH  MathSciNet  Google Scholar 

  3. K. V. Shakhbazyan, “Representation of the lattice of processes in a graph by an algebra of pairs. Isomorphism theorem,” Kibernetika, No. 4, 114–116 (1990).

    MathSciNet  Google Scholar 

  4. K. V. Shakhbazyan and N. B. Lebedinskaya, “Lattices of processes in graphs,” Zapiski Nauchnykh Seminarov LOMI,202, 135–153 (1993).

    Google Scholar 

  5. J. Hartmanis and R. Stearnes, “Algebra of pairs and its application in automata theory,” Kibern. Sb., new series, No. 6, 89–112 (1969).

    Google Scholar 

Download references

Authors
  1. K. V. Shakhbazyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 23–29, January–February, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shakhbazyan, K.V. Lattices of processes in graphs with inputs. Cybern Syst Anal 31, 15–20 (1995). https://doi.org/10.1007/BF02366791

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation