Information Flow on Directed Acyclic Graphs
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.
Unable to display preview. Download preview PDF.
- 1.Sutherland, D.: A model of information. In: Proceedings of Ninth National Computer Security Conference, pp. 175–183 (1986)Google Scholar
- 5.Armstrong, W.W.: Dependency structures of data base relationships. In: Information Processing 1974, Proc. IFIP Congress, Stockholm, pp. 580–583. North-Holland, Amsterdam (1974)Google Scholar
- 6.Garcia-Molina, H., Ullman, J., Widom, J.: Database Systems: The Complete Book, 2nd edn. Prentice-Hall, Englewood Cliffs (2009)Google Scholar
- 8.Miner More, S., Naumov, P.: Functional dependence of secrets in a collaboration network. CoRR arXiv:1011.0399v1 [cs.LO] (2010)Google Scholar