Author:
BUSI NADIA,GORRIERI ROBERTO
Abstract
Several notions of non-interference have been proposed in the literature for studying the problem of confidentiality in concurrent systems. The common feature of these non-interference properties is that they are all defined as extensional properties based on some notion of behavioural equivalence on systems. Here, instead, we address the problem of defining non-interference by looking at the structure of the systems under investigation. We use a simple class of Petri nets, namely, contact-free elementary net systems, as the system model and define structural non-interference properties based on the absence of particular places in the net: such places show that a suitable causality or conflict relation is present between a high-level transition and a low-level one. We characterise one structural property, called PBNI+, which we show to be equivalent to the well-known behavioural property SBNDC. It essentially captures all the positive information flows (that is, a low-level user can deduce that some high-level action has occurred). We start by providing a characterisation of PBNI+ on contact-free elementary net systems, then extend the definition to cope with the richer class of trace nets.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference20 articles.
1. Elementary Net Systems;Engelfriet;Springer-Verlag Lecture Notes in Computer Science,1998
2. Trace nets and process automata
3. Petri Nets
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Computing a Parametric Reveals Relation For Bounded Equal-Conflict Petri Nets;Transactions on Petri Nets and Other Models of Concurrency XVII;2023-11-01
2. Data-Dependent Confidentiality in DCR Graphs;International Symposium on Principles and Practice of Declarative Programming;2023-10-22
3. Concurrent Hyperproperties;Theories of Programming and Formal Methods;2023
4. A Finite Prefix for Analyzing Information Flow Among Transitions of a Free-Choice Net;IEEE Access;2022
5. Interleaving vs True Concurrency: Some Instructive Security Examples;Application and Theory of Petri Nets and Concurrency;2020