Skip to main content

Abstract

Formalism for analyses of biological systems specified by process algebras is proposed. Biologically motivated it combines several security notions and approaches. It allows us to formalize such properties of biological systems as diagnosability, detection ability and a presence of biological intruders and pathological changes. Resulting properties can be viewed as complementary to security ones. Moreover, these corresponding security properties are generalizations of several traditional ones and can detect security holes otherwise undetected.

Work supported by the grant VEGA 1/0688/10.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

  • Barbuti, R., Gruska, D.P., Maggiolo-Schettini, A., Milazzo, P.: A notion of biological diagnosability inspired by the notion of opacity in systems security. Fundamenta Informaticae 102(1), 19–34 (2010)

    MathSciNet  MATH  Google Scholar 

  • Bossi, A., Focardi, R., Piazza, C., Rossi, S.: Refinement Operators and Information Flow Security. In: Proc. of SEFM 2003. IEEE Computer Society Press (2003)

    Google Scholar 

  • Bryans, J., Koutny, M., Ryan, P.: Modelling non-deducibility using Petri Nets. In: Proc. of the 2nd International Workshop on Security Issues with Petri Nets and other Computational Models (WISP 2004) (2004)

    Google Scholar 

  • Bryans, J., Koutny, M., Mazaré, L., Ryan, P.Y.A.: Opacity Generalised to Transition Systems. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2005. LNCS, vol. 3866, pp. 81–95. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  • Focardi, R., Gorrieri, R., Martinelli, F.: Real-Time information flow analysis. IEEE Journal on Selected Areas in Communications 21 (2003)

    Google Scholar 

  • Gorrieri, R., Martinelli, F., Matteucci, I.: Specification and Analysis of Information Flow Properties for Distributed Systems (2010) (submitted for publications)

    Google Scholar 

  • Gruska, D.P., Maggiolo-Schettini, A.: Nested Timing Attacks. In: Proceedings of FAST 2003, Pisa, pp. 147–161 (2003)

    Google Scholar 

  • Gruska, D.P.: Observation Based System Security. Fundamenta Informaticae 79(3-4), 335–346 (2007)

    MathSciNet  MATH  Google Scholar 

  • Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proc. of IEEE Symposium on Security and Privacy (1982)

    Google Scholar 

  • Milner, R.: Communication and concurrency. Prentice-Hall International, New York (1989)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Gruska, D.P. (2012). Diagnosability of Nested Intruders. In: Suzuki, J., Nakano, T. (eds) Bio-Inspired Models of Network, Information, and Computing Systems. BIONETICS 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32615-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32615-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32614-1

  • Online ISBN: 978-3-642-32615-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics