Information Flow On Directed Acyclic Graphs
WoLLIC'11: Proceedings of the 18th international conference on Logic, language, information and computation（2011）
摘要
The paper considers a multi-argument independence relation between messages sent over the edges of a directed acyclic graph. This relation is a generalization of a relation known in information flow as nondeducibility. A logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable.
更多查看译文
关键词
Action Relation, Information Flow, Continuity Condition, Direct Acyclic Graph, Logical System
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要