自主存取控制的 Petri 网建模和分析  

Modeling and Verifying Discretionary Access Control by Colored Petri Net

作　　者：唐冶文[1] 余巍[1] 白英彩[1] 

机构地区：[1]上海交通大学金桥网络中心

出　　处：《上海交通大学学报》1997年第8期66-70,共5页Journal of Shanghai Jiaotong University

摘　　要：对计算机系统安全中的自主存取控制Ｔａｋｅ－Ｇｒａｎｔ模型提出了一种有色Ｐｅｔｒｉ网表达．并用可达性树技术对ｃａｎ．ｓｈａｒｅ问题提供了一个更为简明实用的解答．文中用一个实际的信息处理系统为例。Discretionary access control(DAC)is a practical issue in study on general system security.In this paper a capability based Take Grant model is interpreted as a colored Petri net. So reachability tree technique can be used to analyze and verify some security properties in computer systems. A data process system is introduced as an example to demonstrate how it does. Finally,a solution for can share predicate is presented on the basis of the Petri net model described above.

关 键 词：PETRI网 计算机系统 自主存取控制 安全性 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]