Information Flow on Directed Acyclic Graphs
- Cite this paper as:
- Donders M., Miner More S., Naumov P. (2011) Information Flow on Directed Acyclic Graphs. In: Beklemishev L.D., de Queiroz R. (eds) Logic, Language, Information and Computation. WoLLIC 2011. Lecture Notes in Computer Science, vol 6642. Springer, Berlin, Heidelberg
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.