Skip to main content

A Survey on Non-interference with Petri Nets

  • Chapter
Lectures on Concurrency and Petri Nets (ACPN 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3098))

Included in the following conference series:

Abstract

Several notions of non-interference have been proposed in the literature to study the problem of confidentiality in nondeterministic and concurrent systems. Here we rephrase some of them – notably SNNI and BNDC – over the model of safe Place/Transition Petri Nets. 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 we also address the problem of defining non-interference by looking at the structure of the net systems under investigation. We define structural non-interference properties based on the absence of particular places in the net. We characterize structural properties that are slight refinement of well-known properties such as SNNI and SBNDC. We then argue that, in order to capture all the intuitive interferences at the structural level, it is necessary to consider the net originated by the region construction, yielding the property RBNI we advocate.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Badouel, E., Darondeau, P.: Theory of regions. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 529–586. Springer, Heidelberg (1998)

    Google Scholar 

  2. Desel, J., Reisig, W.: The synthesis problem of Petri nets. Acta Informatica 33, 296–315 (1996)

    Article  MathSciNet  Google Scholar 

  3. Degano, P., De Nicola, R., Montanari, U.: A Distributed Operational Semantics for CCS based on C/E Systems. Acta Informatica 26, 59–91 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures; I and II. Acta Informatica 27, 315–368 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Engelfriet, J., Rozenberg, G.: Elementary Net Systems. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491. Springer, Heidelberg (1998)

    Google Scholar 

  6. Focardi, R., Gorrieri, R.: A Classification of Security Properties. Journal of Computer Security 3(1), 5–33 (1995)

    Google Scholar 

  7. Focardi, R., Gorrieri, R.: Classification of Security Properties (Part I: Information Flow). In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol. 2171, pp. 331–396. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Goguen, J.A., Meseguer, J.: Security Policy and Security Models. In: Proc. of Symposium on Security and Privacy, pp. 11–20. IEEE CS Press, Los Alamitos (1982)

    Google Scholar 

  9. Petri, C.A.: Kommunikation mit Automaten, PhD Thesis, Institut für Instrumentelle Mathematik, Bonn, Germany (1962)

    Google Scholar 

  10. Reisig, W.: Petri Nets: An Introduction. EATCS Monographs in Computer Science. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  11. Roscoe, A.W.: CSP and Determinism in Security Modelling. In: Proc. of IEEE Symposium on Security and Privacy, pp. 114–127. IEEE CS Press, Los Alamitos (1995)

    Google Scholar 

  12. Ryan, P.Y.A.: Mathematical Models of Computer Security. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol. 2171, pp. 1–62. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Ryan, P.Y.A., Schneider, S.: Process Algebra and Noninterference. In: Proc. of 12th Computer Security Foundations Workshop, pp. 214–227. IEEE CS Press, Los Alamitos (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Busi, N., Gorrieri, R. (2004). A Survey on Non-interference with Petri Nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds) Lectures on Concurrency and Petri Nets. ACPN 2003. Lecture Notes in Computer Science, vol 3098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27755-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27755-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22261-3

  • Online ISBN: 978-3-540-27755-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics