Chapter

Logic, Language, Information and Computation

Volume 6642 of the series Lecture Notes in Computer Science pp 95-109

Information Flow on Directed Acyclic Graphs

  • Michael DondersAffiliated withCarnegie Mellon UniversityDepartment of Mathematics and Computer Science, McDaniel College
  • , Sara Miner MoreAffiliated withCarnegie Mellon UniversityDepartment of Mathematics and Computer Science, McDaniel College
  • , Pavel NaumovAffiliated withCarnegie Mellon UniversityDepartment of Mathematics and Computer Science, McDaniel College

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.