Hostname: page-component-77f85d65b8-8v9h9 Total loading time: 0 Render date: 2026-03-29T05:37:03.656Z Has data issue: false hasContentIssue false
  • English
  • Français

Structural non-interference in elementary and trace nets

Published online by Cambridge University Press:  04 December 2009

NADIA BUSI  and
ROBERTO GORRIERI
NADIA BUSI
Affiliation:
Università di Bologna, Dipartimento di Scienze dell'Informazione, Mura Anteo Zamboni 7, 40127 Bologna, Italy Email: gorrieri@cs.unibo.it
ROBERTO GORRIERI
Affiliation:
Università di Bologna, Dipartimento di Scienze dell'Informazione, Mura Anteo Zamboni 7, 40127 Bologna, Italy Email: gorrieri@cs.unibo.it
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 19 , Special Issue 6: Dedicated to Nadia Busi , December 2009 , pp. 1065 - 1090
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Badouel, E. and Darondeau, Ph. (1995) Trace nets and process automata. Acta Informatica 32 647–679.CrossRefGoogle Scholar
Badouel, E. and Darondeau, Ph. (1998) Theory of regions. In: Reisig, W. and Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. Springer-Verlag Lecture Notes in Computer Science 1491 529–586.CrossRefGoogle Scholar
Bossi, A., Focardi, R., Macedonio, D., Piazza, C. and Rossi, S. (2004) Unwinding in Information Flow Security. Electronic Notes in Theoretical Computer Science 99 127–154.CrossRefGoogle Scholar
Brookes, S. D., Hoare, C. A. R. and Roscoe, A. W. (1984) A Theory of Communicating Sequential Processes. Journal of the ACM 31 (3)560–599.CrossRefGoogle Scholar
Busi, N. and Gorrieri, R. (2004a) Structural Non-Interference with Petri Nets. Workshop on Issues in the Theory of Security (WITS'04).CrossRefGoogle Scholar
Busi, N. and Gorrieri, R. (2004b) A Survey on Non-Interference with Petri Nets. Advanced Course on Petri Nets 2003. Springer-Verlag Lecture Notes in Computer Science 3098 328–344.CrossRefGoogle Scholar
Busi, N. and Gorrieri, R. (2004c) Positive Non-Interference in Elementary and Trace Nets. Proceedings 25th International Conference on Application and Theory of Petri Nets. Springer-Verlag Lecture Notes in Computer Science 3099 1–16.CrossRefGoogle Scholar
Engelfriet, J. and Rozenberg, G. (1998) Elementary Net Systems. In: Reisig, W. and Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. Springer-Verlag Lecture Notes in Computer Science 1491 12–121.Google Scholar
Focardi, R. and Gorrieri, R. (1995) A Classification of Security Properties. Journal of Computer Security 3 (1)5–33.CrossRefGoogle Scholar
Focardi, R. and Gorrieri, R. (1997) The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties. IEEE Transactions on Software Engineering 23 (9)550–571.CrossRefGoogle Scholar
Focardi, R. and Gorrieri, R. (2001) Classification of Security Properties (Part I: Information Flow). In: Focardi, R. and Gorrieri, R. (eds.) Foundations of Security Analysis and Design – Tutorial Lectures. Springer-Verlag Lecture Notes in Computer Science 2171 331–396.CrossRefGoogle Scholar
Frau, S. (2008) Uno strumento sotware per l'analisi di proprietà di sicurezza su reti di Petri. Masters thesis (in Italian), University of Bologna, March 2008.Google Scholar
Goguen, J. A. and Meseguer, J. (1982) Security Policy and Security Models. In: Proceedings of Symposium on Security and Privacy, IEEE CS Press 11–20.Google Scholar
Gruska, D. P. (2007) Observation Based System Security. Fundamenta Informaticae 79 (3-4)335–346.Google Scholar
Milner, R. (1989) Communication and Concurrency, Prentice-Hall.Google Scholar
Petri, C. A. (1962) Kommunikation mit Automaten, Ph.D. Thesis, Institut für Instrumentelle Mathematik, Bonn, Germany.Google Scholar
Reisig, W. (1985) Petri Nets: An Introduction, EATCS Monographs in Computer Science, Springer-Verlag.CrossRefGoogle Scholar
Roscoe, A. W. (1995) CSP and Determinism in Security Modelling. In: Proceedings of IEEE Symposium on Security and Privacy, IEEE CS Press 114–127.Google Scholar
Ryan, P. Y. A. (2001) Mathematical Models of Computer Security. In: Focardi, R. and Gorrieri, R. (eds.) Foundations of Security Analysis and Design – Tutorial Lectures. Springer-Verlag Lecture Notes in Computer Science 2171 1–62.CrossRefGoogle Scholar
Ryan, P. Y. A. and Schneider, S. (1999) Process Algebra and Noninterference. In: Proceedings of 12th Computer Security Foundations Workshop, IEEE CS Press 214–227.CrossRefGoogle Scholar