publication . Preprint . 2014

A Framework for Hybrid Systems with Denial-of-Service Security Attack

Wang, Shuling; Nielson, Flemming; Nielson, Hanne Riis;
Open Access English
  • Published: 24 Mar 2014
Abstract
Hybrid systems are integrations of discrete computation and continuous physical evolution. The physical components of such systems introduce safety requirements, the achievement of which asks for the correct monitoring and control from the discrete controllers. However, due to denial-of-service security attack, the expected information from the controllers is not received and as a consequence the physical systems may fail to behave as expected. This paper proposes a formal framework for expressing denial-of-service security attack in hybrid systems. As a virtue, a physical system is able to plan for reasonable behavior in case the ideal control fails due to unre...
Subjects
free text keywords: Computer Science - Logic in Computer Science, Computer Science - Cryptography and Security, Computer Science - Systems and Control
Related Organizations
Download from

1. R. Alur, C. Courcoubetis, T. A. Henzinger, and P. Ho. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems, LNCS 736, pages 209-229, 1992.

2. R. Alur, T. Dang, and F. Ivancic. Predicate abstraction for reachability analysis of hybrid systems. ACM Trasactions on Embedded Computing Systems, 5(1):152-199, 2006. [OpenAIRE]

3. E. Asarin, O. Bournez, T. Dang, and O. Maler. Approximate reachability analysis of piecewise-linear dynamical systems. In HSCC'00, LNCS 1790, pages 21-31, 2000. [OpenAIRE]

4. E. M. Clarke, A. Fehnker, Z. Han, B. H. Krogh, J. Ouaknine, O.Stursberg, and M. Theobald. Abstraction and counterexample-guided refinement in model checking of hybrid systems. nt. J. Found. Comput. Sci., 14(4):583-604, 2003.

5. J. He. From CSP to hybrid systems. In A classical mind, pages 171-189. Prentice Hall International (UK) Ltd., 1994.

6. T. A. Henzinger. The theory of hybrid automata. In LICS'96, pages 278-292, 1996.

7. G. Lafferrierre, G. J. Pappas, and S. Yovine. Symbolic reachability computation for families of linear vector fields. Journal of Symbolic Computation, 11:1-23, 2001.

8. J. Liu, J. Lv, Z. Quan, N. Zhan, H. Zhao, C. Zhou, and L. Zou. A calculus for hybrid CSP. In APLAS'10, LNCS 6461, pages 1-15. Springer, 2010.

9. J. Liu, N. Zhan, and H. Zhao. Computing semi-algebraic invariants for polynomial dynamical systems. In EMSOFT'11, pages 97-106. ACM, 2011.

10. N. Lynch, R. Segala, F. Vaandrager, and H. Weinberg. Hybrid I/O automata. In HSCC'96, LNCS 1066, pages 496-510, 1996. [OpenAIRE]

Abstract
Hybrid systems are integrations of discrete computation and continuous physical evolution. The physical components of such systems introduce safety requirements, the achievement of which asks for the correct monitoring and control from the discrete controllers. However, due to denial-of-service security attack, the expected information from the controllers is not received and as a consequence the physical systems may fail to behave as expected. This paper proposes a formal framework for expressing denial-of-service security attack in hybrid systems. As a virtue, a physical system is able to plan for reasonable behavior in case the ideal control fails due to unre...
Subjects
free text keywords: Computer Science - Logic in Computer Science, Computer Science - Cryptography and Security, Computer Science - Systems and Control
Related Organizations
Download from

1. R. Alur, C. Courcoubetis, T. A. Henzinger, and P. Ho. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems, LNCS 736, pages 209-229, 1992.

2. R. Alur, T. Dang, and F. Ivancic. Predicate abstraction for reachability analysis of hybrid systems. ACM Trasactions on Embedded Computing Systems, 5(1):152-199, 2006. [OpenAIRE]

3. E. Asarin, O. Bournez, T. Dang, and O. Maler. Approximate reachability analysis of piecewise-linear dynamical systems. In HSCC'00, LNCS 1790, pages 21-31, 2000. [OpenAIRE]

4. E. M. Clarke, A. Fehnker, Z. Han, B. H. Krogh, J. Ouaknine, O.Stursberg, and M. Theobald. Abstraction and counterexample-guided refinement in model checking of hybrid systems. nt. J. Found. Comput. Sci., 14(4):583-604, 2003.

5. J. He. From CSP to hybrid systems. In A classical mind, pages 171-189. Prentice Hall International (UK) Ltd., 1994.

6. T. A. Henzinger. The theory of hybrid automata. In LICS'96, pages 278-292, 1996.

7. G. Lafferrierre, G. J. Pappas, and S. Yovine. Symbolic reachability computation for families of linear vector fields. Journal of Symbolic Computation, 11:1-23, 2001.

8. J. Liu, J. Lv, Z. Quan, N. Zhan, H. Zhao, C. Zhou, and L. Zou. A calculus for hybrid CSP. In APLAS'10, LNCS 6461, pages 1-15. Springer, 2010.

9. J. Liu, N. Zhan, and H. Zhao. Computing semi-algebraic invariants for polynomial dynamical systems. In EMSOFT'11, pages 97-106. ACM, 2011.

10. N. Lynch, R. Segala, F. Vaandrager, and H. Weinberg. Hybrid I/O automata. In HSCC'96, LNCS 1066, pages 496-510, 1996. [OpenAIRE]

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue