Geodesic
Conditions for functions on semilattices to be realized by networks with stable behaviour under hazards
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 8 (2008) no. 1, pp. 55-58 
I. A. Pankratova. Conditions for functions on semilattices to be realized by networks with stable behaviour under hazards. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 8 (2008) no. 1, pp. 55-58. http://geodesic.mathdoc.fr/item/ISU_2008_8_1_a9/
@article{ISU_2008_8_1_a9,
     author = {I. A. Pankratova},
     title = {Conditions for functions on semilattices to be realized by networks with stable behaviour under hazards},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {55--58},
     year = {2008},
     volume = {8},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2008_8_1_a9/}
}
TY  - JOUR
AU  - I. A. Pankratova
TI  - Conditions for functions on semilattices to be realized by networks with stable behaviour under hazards
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2008
SP  - 55
EP  - 58
VL  - 8
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ISU_2008_8_1_a9/
LA  - ru
ID  - ISU_2008_8_1_a9
ER  - 
%0 Journal Article
%A I. A. Pankratova
%T Conditions for functions on semilattices to be realized by networks with stable behaviour under hazards
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2008
%P 55-58
%V 8
%N 1
%U http://geodesic.mathdoc.fr/item/ISU_2008_8_1_a9/
%G ru
%F ISU_2008_8_1_a9

Voir la notice de l'article provenant de la source Math-Net.Ru

The notion of functional stability under hazards is introduced for networks realizing functions defined on finite upper semilattices. Some constructive conditions are established for such functions to be realized by stable networks composed of any elements or of transistors and switches.

[1] Agibalov G. P., Diskretnye avtomaty na polureshetkakh, Izd-vo Tomsk. un-ta, Tomsk, 1993 | Zbl

[2] Eichelberger E. B., “Hazard Detection in Combinational and Sequential Switching Circuits”, IBM Journal of Research and Development, 9:2 (1965), 90–99 | DOI | Zbl

[3] Miller R., Teoriya pereklyuchatelnykh skhem, v. 2, Nauka, M., 1971

[4] Yablonskii S. V., “Osnovnye ponyatiya kibernetiki”, Problemy kibernetiki, 2, Nauka, M., 1959, 7–38

[5] Roginskii V. N., Osnovy diskretnoi avtomatiki, Svyaz, M., 1975

[6] Chebotarev A. N., “Risk v asinkhronnykh logicheskikh skhemakh”, Kibernetika, 1976, no. 4, 8–11 | Zbl

[7] Agibalov G. P., Komarov Yu. M., Lipskii V. B., “Sintez kombinatsionnykh skhem, svobodnykh ot staticheskikh sostyazanii”, Avtomatika i vychislitelnaya tekhnika, 1979, no. 1, 1–6 | MR | Zbl

[8] Pankratova I. A., “Usloviya realizuemosti funktsii na polureshetke v realnykh bazisakh pereklyuchatelnykh elementov”, Diskretnyi analiz i issledovanie operatsii. Ser. 1, 13:3 (2006), 40–61 | MR | Zbl