Information flow on directed acyclic graphs
Information flow on directed acyclic graphs
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.
95-109
Donders, Michael
e1ee654b-4a1f-4d7c-b8e8-76546ea202bd
Miner More, Sara
beaf43e1-66cd-4f05-a95a-3136738051fe
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
20 May 2011
Donders, Michael
e1ee654b-4a1f-4d7c-b8e8-76546ea202bd
Miner More, Sara
beaf43e1-66cd-4f05-a95a-3136738051fe
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Donders, Michael, Miner More, Sara and Naumov, Pavel
(2011)
Information flow on directed acyclic graphs.
In Logic, Language, Information and Computation - 18th International Workshop, WoLLIC 2011, Proceedings.
vol. 6642 LNAI,
Springer.
.
(doi:10.1007/978-3-642-20920-8_13).
Record type:
Conference or Workshop Item
(Paper)
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.
This record has no associated files available for download.
More information
Published date: 20 May 2011
Identifiers
Local EPrints ID: 475883
URI: http://eprints.soton.ac.uk/id/eprint/475883
ISSN: 0302-9743
PURE UUID: b569b83d-248b-4f45-b1fe-66cf7fe234df
Catalogue record
Date deposited: 29 Mar 2023 16:53
Last modified: 06 Jun 2024 02:12
Export record
Altmetrics
Contributors
Author:
Michael Donders
Author:
Sara Miner More
Author:
Pavel Naumov
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics