Concurrency semantics for the Geiger-Paz-Pearl axioms of independence
Concurrency semantics for the Geiger-Paz-Pearl axioms of independence
Independence between two sets of random variables is a well-known relation in probability theory. Its origins trace back to Abraham de Moivre's work in the 18th century. The propositional theory of this relation was axiomatized by Geiger, Paz, and Pearl. Sutherland introduced a relation in information flow theory that later became known as "non-deducibility." Subsequently, the first two authors generalized this relation from a relation between two arguments to a relation between two sets of arguments and proved that it is completely described by essentially the same axioms as independence in probability theory. This paper considers a non-interference relation between two groups of concurrent processes sharing common resources. Two such groups are called non-interfering if, when executed concurrently, the only way for them to reach deadlock is for one of the groups to deadlock internally. The paper shows that a complete axiomatization of this relation is given by the same Geiger-Paz-Pearl axioms.
Axiomatization, Concurrency, Independence, Information flow
443-457
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
More, Sara Miner
979b2749-1732-4a36-abda-64b4f6899ea9
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Sapp, Benjamin
4cf155a8-3124-4930-8e4d-d51b453a9963
31 August 2011
More, Sara Miner
979b2749-1732-4a36-abda-64b4f6899ea9
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Sapp, Benjamin
4cf155a8-3124-4930-8e4d-d51b453a9963
More, Sara Miner, Naumov, Pavel and Sapp, Benjamin
(2011)
Concurrency semantics for the Geiger-Paz-Pearl axioms of independence.
In Computer Science Logic 2011 - 25th International Workshop/20th Annual Conference of the EACSL, CSL 2011.
vol. 12,
Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
.
(doi:10.4230/LIPIcs.CSL.2011.443).
Record type:
Conference or Workshop Item
(Paper)
Abstract
Independence between two sets of random variables is a well-known relation in probability theory. Its origins trace back to Abraham de Moivre's work in the 18th century. The propositional theory of this relation was axiomatized by Geiger, Paz, and Pearl. Sutherland introduced a relation in information flow theory that later became known as "non-deducibility." Subsequently, the first two authors generalized this relation from a relation between two arguments to a relation between two sets of arguments and proved that it is completely described by essentially the same axioms as independence in probability theory. This paper considers a non-interference relation between two groups of concurrent processes sharing common resources. Two such groups are called non-interfering if, when executed concurrently, the only way for them to reach deadlock is for one of the groups to deadlock internally. The paper shows that a complete axiomatization of this relation is given by the same Geiger-Paz-Pearl axioms.
This record has no associated files available for download.
More information
Published date: 31 August 2011
Venue - Dates:
25th International Workshop on Computer Science Logic, CSL 2011/20th Annual Conference of the European Association for Computer Science Logic, EACSL, , Bergen, Norway, 2011-09-12 - 2011-09-15
Keywords:
Axiomatization, Concurrency, Independence, Information flow
Identifiers
Local EPrints ID: 475992
URI: http://eprints.soton.ac.uk/id/eprint/475992
ISSN: 1868-8969
PURE UUID: 1a0ee596-f7b0-4557-aa09-e7587e88bb7b
Catalogue record
Date deposited: 03 Apr 2023 16:54
Last modified: 17 Mar 2024 04:10
Export record
Altmetrics
Contributors
Author:
Sara Miner More
Author:
Pavel Naumov
Author:
Benjamin Sapp
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