Information Flow on Directed Acyclic Graphs

  • Michael Donders
  • Sara Miner More
  • Pavel Naumov
Conference paper

DOI: 10.1007/978-3-642-20920-8_13

Volume 6642 of the book series Lecture Notes in Computer Science (LNCS)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael Donders
    • 1
  • Sara Miner More
    • 1
  • Pavel Naumov
    • 1
  1. 1.Department of Mathematics and Computer ScienceMcDaniel CollegeWestminsterUSA