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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Donders, M., Miner More, S., & Naumov, P. (2011). Information flow on directed acyclic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6642 LNAI, pp. 95–109). Springer Verlag. https://doi.org/10.1007/978-3-642-20920-8_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
