Geodesic
Closure of basic role DP-model
Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 41-44

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

Two kinds of access graph closure are defined here for the role DP-model, and algorithms for the construction of them are suggested in the paper. The results are aimed to verify for all the users, entities and access rights simultaneously if the predicate $can\_share()$ is true meaning the possibility of taking ownership access rights of a trusted subject by an untrusted subject in a computer system with discretionary access and information stream management. 
@article{PDM_2009_10_a20,
     author = {M. A. Kachanov},
     title = {Closure of basic role {DP-model}},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {41--44},
     publisher = {mathdoc},
     number = {10},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2009_10_a20/}
}
TY  - JOUR
AU  - M. A. Kachanov
TI  - Closure of basic role DP-model
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2009
SP  - 41
EP  - 44
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2009_10_a20/
LA  - ru
ID  - PDM_2009_10_a20
ER  - 
%0 Journal Article
%A M. A. Kachanov
%T Closure of basic role DP-model
%J Prikladnaâ diskretnaâ matematika
%D 2009
%P 41-44
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2009_10_a20/
%G ru
%F PDM_2009_10_a20
M. A. Kachanov. Closure of basic role DP-model. Prikladnaâ diskretnaâ matematika, no. 10 (2009), pp. 41-44. http://geodesic.mathdoc.fr/item/PDM_2009_10_a20/