{"title":"指定数据共享协议","authors":"Vipin Swarup, Leonard J. Seligman, A. Rosenthal","doi":"10.1109/POLICY.2006.34","DOIUrl":null,"url":null,"abstract":"When consumers build value-added services on top of data resources they do not control, they need to manage their information supply chains to ensure that their data suppliers produce and supply required data as needed. Producers also need to manage their information supply chains to ensure that their data is disseminated and protected appropriately. In this paper, we present a novel model for data sharing agreements that supports a wide variety of data sharing policies. The model is based on distributed temporal logic (DTL) predicates that are expressed over events in dataflow graphs. A dataflow graph's nodes are principals with local stores, and its edges are (typed) channels along which dataflows. We illustrate the model via examples and discuss the kinds of analyses enabled by the model","PeriodicalId":169233,"journal":{"name":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Specifying data sharing agreements\",\"authors\":\"Vipin Swarup, Leonard J. Seligman, A. Rosenthal\",\"doi\":\"10.1109/POLICY.2006.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When consumers build value-added services on top of data resources they do not control, they need to manage their information supply chains to ensure that their data suppliers produce and supply required data as needed. Producers also need to manage their information supply chains to ensure that their data is disseminated and protected appropriately. In this paper, we present a novel model for data sharing agreements that supports a wide variety of data sharing policies. The model is based on distributed temporal logic (DTL) predicates that are expressed over events in dataflow graphs. A dataflow graph's nodes are principals with local stores, and its edges are (typed) channels along which dataflows. We illustrate the model via examples and discuss the kinds of analyses enabled by the model\",\"PeriodicalId\":169233,\"journal\":{\"name\":\"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/POLICY.2006.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh IEEE International Workshop on Policies for Distributed Systems and Networks (POLICY'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/POLICY.2006.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
When consumers build value-added services on top of data resources they do not control, they need to manage their information supply chains to ensure that their data suppliers produce and supply required data as needed. Producers also need to manage their information supply chains to ensure that their data is disseminated and protected appropriately. In this paper, we present a novel model for data sharing agreements that supports a wide variety of data sharing policies. The model is based on distributed temporal logic (DTL) predicates that are expressed over events in dataflow graphs. A dataflow graph's nodes are principals with local stores, and its edges are (typed) channels along which dataflows. We illustrate the model via examples and discuss the kinds of analyses enabled by the model