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

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 unreliable communication, in such a way that the safety of the system upon denial-of-service is still guaranteed. In the context of the modeling language, we develop an inference system for verifying safety of hybrid systems, without putting any assumptions on how the environments behave. Based on the inference system, we implement an interactive theorem prover and have applied it to check an example taken from train control system.

[1]  Nancy A. Lynch,et al.  Hybrid I/O automata , 2003, Inf. Comput..

[2]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[3]  Flemming Nielson,et al.  A Calculus for Quality , 2012, FACS.

[4]  Flemming Nielson,et al.  Probabilistic Analysis of the Quality Calculus , 2013, FMOODS/FORTE.

[5]  Naijun Zhan,et al.  Formal Modelling, Analysis and Verification of Hybrid Systems , 2013, ICTAC Training School on Software Engineering.

[6]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[7]  Olivier Bournez,et al.  Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems , 2000, HSCC.

[8]  Naijun Zhan,et al.  Computing semi-algebraic invariants for polynomial dynamical systems , 2011, 2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT).

[9]  Rajeev Alur,et al.  Predicate abstraction for reachability analysis of hybrid systems , 2006, TECS.

[10]  André Platzer,et al.  European Train Control System: A Case Study in Formal Verification , 2009, ICFEM.

[11]  Zhou Chaochen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems , 2004 .

[12]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

[13]  Joël Ouaknine,et al.  Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems , 2003, Int. J. Found. Comput. Sci..

[14]  Zohar Manna,et al.  Verifying Hybrid Systems , 1992, Hybrid Systems.

[15]  Chaochen Zhou,et al.  A Calculus for Hybrid CSP , 2010, APLAS.

[16]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[17]  Michael R. Hansen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris) , 2004 .

[18]  He Jifeng,et al.  From CSP to hybrid systems , 1994 .

[19]  André Platzer,et al.  Differential-algebraic Dynamic Logic for Differential-algebraic Programs , 2010, J. Log. Comput..

[20]  Gerardo Lafferriere,et al.  Symbolic Reachability Computation for Families of Linear Vector Fields , 2001, J. Symb. Comput..

[21]  Anders P. Ravn,et al.  A Formal Description of Hybrid Systems , 1996, Hybrid Systems.