Skip to main content
SpringerLink
Log in

Information Flow for Timed Automata

  • Chapter
  • First Online:
Models, Algorithms, Logics and Tools

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10460))

Abstract

One of the key demands of cyberphysical systems is that they meet their safety goals. Timed Automata has established itself as a formalism for modelling and analysing the real-time safety aspects of cyberphysical systems. Increasingly it is also demanded that cyberphysical systems meet a number of security goals for confidentiality and integrity. Information Flow Control is an approach to ensuring that there are no flows of information that violate the stated security policy.

We develop a language based approach to the modelling and analysis of timed systems that allows to incorporate considerations of information flow control. We define a type system for information flow that takes account of the non-determinism and clocks of timed systems. The adequacy of the type system is ensured by means of a non-interference result.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Aceto, L., Ingolfsdottir, A., Larsen, K.G., Srba, J.: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  2. Agat, J.: Transforming out timing leaks. In: Proceedings of the POPL, pp. 40–53 (2000)

    Google Scholar 

  3. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Apt, K.R.: Ten years of Hoare’s logic: a survey - part 1. ACM Trans. Program. Lang. Syst. 3(4), 431–483 (1981)

    Article  MATH  Google Scholar 

  5. Banâtre, J.-P., Bryce, C., Métayer, D.: Compile-time detection of information flow in sequential programs. In: Gollmann, D. (ed.) ESORICS 1994. LNCS, vol. 875, pp. 55–73. Springer, Heidelberg (1994). doi:10.1007/3-540-58618-0_56

    Google Scholar 

  6. Barbuti, R., De Francesco, N., Santone, A., Tesei, L.: A notion of non-interference for timed automata. Fundam. Inform. 51(1–2), 1–11 (2002)

    MathSciNet  MATH  Google Scholar 

  7. Barbuti, R., Tesei, L.: A decidable notion of timed non-interference. Fundam. Inform. 54(2–3), 137–150 (2003)

    MathSciNet  MATH  Google Scholar 

  8. Bordbar, B., Okano, K.: Testing deadlock-freeness in real-time systems: a formal approach. In: Grabowski, J., Nielsen, B. (eds.) FATES 2004. LNCS, vol. 3395, pp. 95–109. Springer, Heidelberg (2005). doi:10.1007/978-3-540-31848-4_7

    Chapter  Google Scholar 

  9. Denning, D.E., Denning, P.J.: Certification of programs for secure information flow. Commun. ACM 20(7), 504–513 (1977)

    Article  MATH  Google Scholar 

  10. Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453–457 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  11. Focardi, R., Gorrieri, R., Martinelli, F.: Real-time information flow analysis. IEEE J. Sel. Areas Commun. 21(1), 20–35 (2003)

    Article  Google Scholar 

  12. Gardey, G., Mullins, J., Roux, O.H.: Non-interference control synthesis for security timed automata. Electr. Notes Theor. Comput. Sci. 180(1), 35–53 (2007)

    Article  MATH  Google Scholar 

  13. Lanotte, R., Maggiolo-Schettini, A., Troina, A.: Time and probability-based information flow analysis. IEEE Trans. Softw. Eng. 36(5), 719–734 (2010)

    Article  MATH  Google Scholar 

  14. Myers, A.C., Liskov, B.: A decentralized model for information flow control. In: ACM Symposium on Operating System Principles, SOSP 1997, pp. 129–142. ACM (1997)

    Google Scholar 

  15. Hanne Riis Nielson and Flemming Nielson: Content dependent information flow control. J. Log. Algebr. Meth. Program. 87, 6–32 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  16. UPPAAL. http://www.uppaal.com/index.php?sida=200&rubrik=95

  17. Volpano, D.M., Smith, G., Irvine, C.E.: A sound type system for secure flow analysis. J. Comput. Secur. 4(2/3), 167–188 (1996)

    Article  Google Scholar 

  18. Zdancewic, S., Myers, A.C.: Observational determinism for concurrent program security. In: Proceedings of the CSFW, pp. 29–43 (2003)

    Google Scholar 

Download references

Acknowledgment

The authors are supported in part by the IDEA4CPS Reseearch Centre studying the Foundations for Cyber-Physical Systems and granted by the Danish Research Foundation for Basic Research (DNRF86-10). We would like to thank Ximeng Li for commenting upon a previous version.

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kongens Lyngby, Denmark

    Flemming Nielson, Hanne Riis Nielson & Panagiotis Vasilikos

Authors
  1. Flemming Nielson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanne Riis Nielson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panagiotis Vasilikos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Flemming Nielson .

Editor information

Editors and Affiliations

  1. Reykjavik University, Reykjavik, Iceland

    Luca Aceto

  2. Aalborg University, Aalborg, Denmark

    Giorgio Bacci

  3. Aalborg University, Aalborg, Denmark

    Giovanni Bacci

  4. Reykjavík University, Reykjavik, Iceland

    Anna Ingólfsdóttir

  5. Inria Campus Beaulieu, Rennes, France

    Axel Legay

  6. Aalborg University, Aalborg, Denmark

    Radu Mardare

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Nielson, F., Nielson, H.R., Vasilikos, P. (2017). Information Flow for Timed Automata. In: Aceto, L., Bacci, G., Bacci, G., Ingólfsdóttir, A., Legay, A., Mardare, R. (eds) Models, Algorithms, Logics and Tools. Lecture Notes in Computer Science(), vol 10460. Springer, Cham. https://doi.org/10.1007/978-3-319-63121-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63121-9_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63120-2

  • Online ISBN: 978-3-319-63121-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation