Abstract
The structure of the lattice of processes of a finite digraph with entries is investigated. Necessary and sufficient conditions for the isomorphism of a given lattice to the lattice of processes of a certain digraph are obtained. Bibliography: 5 titles.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
K. V. Shakhbazyan, T. A. Tushkina, and M. M. Lebedinskii, “Decomposition in pipelines,”Zap. Nauchn. Semin. LOMI,159, 47–55 (1987).
K. V. Shakhbazyan, “On the algebra of processes in graphs,”Kibernetika,6, 38–42 (1988).
K. V. Shakhbazyan, “A representation of the lattice of processes in a graph by a pair algebra. An isomorphism theorem,”Kibernetika,4, 114–116 (1990).
K. V. Shakhbazyan, T. A. Tushkina, and M. M. Lebedinskii, “The lattices of processes in graphs and congruences by an ideal in distributive lattices,” Preprint POMI, P-4-90, St. Petersburg (1990).
G. Grätzer,General Lattice Theory, Academie-Verlag, Berlin (1978).
Additional information
Translated by K. V. Shakhbazyan.
Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 202, 1992, pp. 135–153.
Rights and permissions
About this article
Cite this article
Shakhbazyan, K.V., Lebedinskaya, N.B. Lattices of processes for graphs. J Math Sci 79, 1115–1125 (1996). https://doi.org/10.1007/BF02366132
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02366132