Information Flow on Directed Acyclic Graphs

* 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.