{"title":"使用Petri网验证系统安全性","authors":"S. Castano, P. Samarati, C. Villa","doi":"10.1109/CCST.1993.386794","DOIUrl":null,"url":null,"abstract":"A tool for verifying security properties of data is described, based on colored Petri nets. A conceptual data model for complex applications and a mandatory security model based on the principles of Bell-LaPadula are presented. The tool operates on such models, using the Petri net analysis techniques, based on the reachability graph. The absence of interference of sensitive associations, the reachability of information, and the temporal relationships among data access properties are studied, and conditions on the reachability graph are defined, to guarantee that such properties hold in the system.<<ETX>>","PeriodicalId":404786,"journal":{"name":"1993 Proceedings of IEEE International Carnahan Conference on Security Technology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Verifying system security using Petri Nets\",\"authors\":\"S. Castano, P. Samarati, C. Villa\",\"doi\":\"10.1109/CCST.1993.386794\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A tool for verifying security properties of data is described, based on colored Petri nets. A conceptual data model for complex applications and a mandatory security model based on the principles of Bell-LaPadula are presented. The tool operates on such models, using the Petri net analysis techniques, based on the reachability graph. The absence of interference of sensitive associations, the reachability of information, and the temporal relationships among data access properties are studied, and conditions on the reachability graph are defined, to guarantee that such properties hold in the system.<<ETX>>\",\"PeriodicalId\":404786,\"journal\":{\"name\":\"1993 Proceedings of IEEE International Carnahan Conference on Security Technology\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 Proceedings of IEEE International Carnahan Conference on Security Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCST.1993.386794\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 Proceedings of IEEE International Carnahan Conference on Security Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCST.1993.386794","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A tool for verifying security properties of data is described, based on colored Petri nets. A conceptual data model for complex applications and a mandatory security model based on the principles of Bell-LaPadula are presented. The tool operates on such models, using the Petri net analysis techniques, based on the reachability graph. The absence of interference of sensitive associations, the reachability of information, and the temporal relationships among data access properties are studied, and conditions on the reachability graph are defined, to guarantee that such properties hold in the system.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
