ABSTRACT
In formal verification, a designer first constructs a model, with mathematically precise semantics, of the system under design, and performs extensive analysis with respect to correctness requirements. The appropriate mathematical model for embedded control systems is hybrid systems that combines the traditional state-machine based models for discrete control with classical differential-equations based models for continuously evolving physical activities. In this article, we briefly review selected existing approaches to formal verification of hybrid systems, along with directions for future research.
- R. Alur, C. Courcoubetis, N. Halbwachs, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3--34, 1995. Google ScholarDigital Library
- R. Alur, C. Courcoubetis, T. Henzinger, and P. Ho. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems, volume LNCS 736, pages 209--229. Springer-Verlag, 1993. Google ScholarCross Ref
- R. Alur, T. Dang, J. Esposito, Y. Hur, F. Ivancic, V. Kumar, I. Lee, P. Mishra, G. Pappas, and O. Sokolsky. Hierarchical modeling and analysis of embedded systems. Proceedings of the IEEE, 91(1), 2003.Google ScholarCross Ref
- R. Alur, T. Dang, and F. Ivancic. Predicate abstraction for reachability analysis of hybrid systems. ACM Transactions on Embedded Computing Systems, 5(1):152--199, 2006. Google ScholarDigital Library
- R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183--235, 1994. Google ScholarDigital Library
- R. Alur and T. Henzinger. Modularity for timed and hybrid systems. In CONCUR '97: Eighth International Conference on Concurrency Theory, LNCS 1243, pages 74--88. Springer-Verlag, 1997. Google ScholarDigital Library
- R. Alur, T. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering, 22(3):181--201, 1996. Google ScholarDigital Library
- R. Alur, T. Henzinger, G. Lafferriere, and G. Pappas. Discrete abstractions of hybrid systems. Proceedings of the IEEE, 88(7):971--984, 2000.Google ScholarCross Ref
- R. Alur, A. Kanade, S. Ramesh, and K. Shashidhar. Symbolic analysis for improving simulation coverage of Simulink/Stateflow models. In Proceedings of the 8th Annual ACM Conference on Embedded Software (EMSOFT), pages 89--98, 2008. Google ScholarDigital Library
- R. Alur and G. Weiss. RTComposer: a framework for real-time components with scheduling interfaces. In Proceedings of the 8th ACM & IEEE International Conference on Embedded Software, pages 159--168, 2008. Google ScholarDigital Library
- E. Asarin, O. Bournez, T. Dang, and O. Maler. Approximate reachability analysis of piecewise-linear dynamical systems. In Hybrid Systems: Computation and Control, Third International Workshop, LNCS 1790, pages 21--31. Springer, 2000. Google ScholarDigital Library
- R. Bagnara, P. M. Hill, and E. Zaffanella. The parma polyhedra library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program., 72(1-2):3--21, 2008. Google ScholarDigital Library
- T. Ball, V. Levin, and S. K. Rajamani. A decade of software model checking with SLAM. Commun. ACM, 54(7):68--76, 2011. Google ScholarDigital Library
- A. Chutinan and B. Krogh. Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations. In Hybrid Systems: Computation and Control, Second International Workshop, LNCS 1569, pages 76--90. Springer, 1999. Google ScholarDigital Library
- E. M. Clarke, E. A. Emerson, and J. Sifakis. Model checking: algorithmic verification and debugging. Commun. ACM, 52(11):74--84, 2009. Google ScholarDigital Library
- E. M. Clarke, A. Fehnker, Z. Han, B. H. Krogh, O. Stursberg, and M. Theobald. Verification of hybrid systems based on counterexample-guided abstraction refinement. In Tools and Algorithms for the Construction and Analysis of Systems, 9th International Conference, LNCS2619, pages 192--207, 2003. Google ScholarDigital Library
- A. Deshpande, A. Göllu, and P. Varaiya. SHIFT: a formalism and a programming language for dynamic networks of hybrid automata. In Hybrid Systems III, LNCS 1567. Springer, 1996.Google Scholar
- A. Donzé and O. Maler. Systematic simulation using sensitivity analysis. In Hybrid Systems: Computation and Control, 10th International Conference, LNCS 4416, pages 174--189. Springer, 2007. Google ScholarDigital Library
- J. Eker, J. Janneck, E. Lee, J. Liu, X. Liu, J. Luvig, S. Neuendorffer, S. Sachs, and Y. Xiong. Taming heterogeneity - the Ptolemy approach. Proceedings of the IEEE, 91(1):127--144, 2003.Google ScholarCross Ref
- G. Frehse, C. Le Guernic, A. Donzé, S. Cotton, R. Ray, O. Lebeltel, R. Ripado, A. Girard, T. Dang, and O. Maler. SpaceEx: Scalable verification of hybrid systems. In Proc. 23rd International Conference on Computer Aided Verification (CAV), LNCS 6806, pages 379--395. Springer, 2011. Google ScholarDigital Library
- A. Girard. Reachability of uncertain linear systems using Zonotopes. In Hybrid Systems: Computation and Control, 8th International Workshop, LNCS 3414, pages 291--305. Springer, 2005. Google ScholarDigital Library
- A. Girard, C. L. Guernic, and O. Maler. Efficient computation of reachable sets of linear time-invariant systems with inputs. In Hybrid Systems: Computation and Control, 9th International Workshop, LNCS 3927, pages 257--271, 2006. Google ScholarDigital Library
- A. Girard and G. Pappas. Approximation metrics for discrete and continuous systems. IEEE Transactions on Automatic Control, 52(5):782--798, 2007.Google ScholarCross Ref
- P. Godefroid, N. Klarlund, and K. Sen. DART: directed automated random testing. In Proceedings of the ACM Conference on Programming Language Design and Implementation, pages 213--223, 2005. Google ScholarDigital Library
- E. Goubault and S. Putot. Static analysis of finite precision computations. In Verification, Model Checking, and Abstract Interpretation - 12th International Conference, LNCS 6538, pages 232--247, 2011. Google ScholarDigital Library
- C. L. Guernic and A. Girard. Reachability analysis of hybrid systems using support functions. In Computer Aided Verification, 21st International Conference, LNCS 5643, pages 540--554, 2009. Google ScholarDigital Library
- S. Gulwani. Automating string processing in spreadsheets using input-output examples. In Proceedings of 38th ACM Symposium on Principles of Programming Languages, pages 317--330, 2011. Google ScholarDigital Library
- S. Gulwani and A. Tiwari. Constraint-based approach for analysis of hybrid systems. In Computer Aided Verification, 20th International Conference, LNCS 5123, pages 190--203, 2008. Google ScholarDigital Library
- T. Henzinger. The theory of hybrid automata. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science, pages 278--293, 1996. Google ScholarDigital Library
- T. Henzinger and P. Ho. Algorithmic analysis of nonlinear hybrid systems. In Proceedings of the Seventh Conference on Computer-Aided Verification, LNCS 939, pages 225--238. Springer-Verlag, 1995. Google ScholarDigital Library
- T. Henzinger, P. Ho, and H. Wong-Toi. HyTech: a model checker for hybrid systems. Software Tools for Technology Transfer, 1(1-2):110--122, 1997.Google ScholarDigital Library
- T. Henzinger, P. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata. In Proceedings of the 27th ACM Symposium on Theory of Computing, pages 373--382, 1995. Google ScholarDigital Library
- T. Henzinger and J. Sifakis. The embedded systems design challenge. In FM 2006: 14th International Symposium on Formal Methods, LNCS 4085, pages 1--15, 2006. Google ScholarDigital Library
- A. Julius, G. Fainekos, M. Anand, I. Lee, and G. Pappas. Robust test generation and coverage for hybrid systems. In Hybrid Systems: Computation and Control, 10th International Conference, LNCS 4416, pages 329--342. Springer, 2007. Google ScholarDigital Library
- G. Karsai, J. Sztipanovits, A. Ledeczi, and T. Bapty. Model-integrated development of embedded software. Proceedings of the IEEE, 91(1):145--164, 2003.Google ScholarCross Ref
- A. Kurzhanski and P. Varaiya. Ellipsoidal techniques for reachability analysis. In Hybrid Systems: Computation and Control, Third International Workshop, LNCS 1790, pages 202--214. Springer, 2000. Google ScholarDigital Library
- E. Lee. What's ahead for embedded software. IEEE Computer, pages 18--26, September 2000. Google ScholarDigital Library
- I. Lee and O. Sokolsky. Medical cyber physical systems. In Proc. 47th Design Automation Conference, pages 743--748, 2010. Google ScholarDigital Library
- S. M. Loos, A. Platzer, and L. Nistor. Adaptive cruise control: Hybrid, distributed, and now formally verified. In FM 2011: Formal Methods, 17th International Symposium on Formal Methods, LNCS 6664, pages 42--56. Springer, 2011. Google ScholarDigital Library
- N. Lynch, R. Segala, F. Vaandrager, and H. Weinberg. Hybrid I/O automata. In Hybrid Systems III: Verification and Control, LNCS 1066, pages 496--510, 1996. Google ScholarDigital Library
- O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In Real-Time: Theory in Practice, REX Workshop, LNCS 600, pages 447--484. Springer-Verlag, 1991. Google ScholarDigital Library
- I. Mitchell and C. Tomlin. Level set methods for computation in hybrid systems. In Hybrid Systems: Computation and Control, Third International Workshop, LNCS 1790, pages 310--323. Springer, 2000. Google ScholarDigital Library
- A. Platzer. Differential dynamic logic for hybrid systems. J. Autom. Reasoning, 41(2):143--189, 2008. Google ScholarDigital Library
- A. Platzer. Logical Analysis of Hybrid Systems - Proving Theorems for Complex Dynamics. Springer, 2010. Google ScholarDigital Library
- A. Platzer and E. M. Clarke. Computing differential invariants of hybrid systems as fixedpoints. In Computer Aided Verification, 20th International Conference, LNCS 5123, pages 176--189, 2008. Google ScholarDigital Library
- A. Platzer and E. M. Clarke. Formal verification of curved flight collision avoidance maneuvers: A case study. In FM 2009: Formal Methods, LNCS 5850, pages 547--562, 2009. Google ScholarDigital Library
- S. Prajna and A. Jadbabaie. Safety verification of hybrid systems using barrier certificates. In Hybrid Systems: Computation and Control, 7th International Workshop, LNCS 2993, pages 477--492, 2004.Google Scholar
- S. Prajna, A. Jadbabaie, and G. J. Pappas. A framework for worst-case and stochastic safety verification using barrier certificates. IEEE Transactions on Automatic Control, 52(8):1415--1429, 2007.Google ScholarCross Ref
- A. Sangiovanni-Vincentelli. Quo Vadis SLD: Reasoning about trends and challenges of system-level design. Proceedings of the IEEE, 95(3):467--506, 2007.Google ScholarCross Ref
- S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Constructing invariants for hybrid systems. Formal Methods in System Design, 32(1):25--55, 2008. Google ScholarDigital Library
- A. Solar-Lezama, R. Rabbah, R. Bodík, and K. Ebcioglu. Programming by sketching for bit-streaming programs. In Proc. 2005 ACM Conference on Programming Language Design and Implementation, pages 281--294, 2005. Google ScholarDigital Library
- P. Tabuada. Verification and control of hybrid systems. Springer, 2009. Google ScholarDigital Library
- A. Taly and A. Tiwari. Switching logic synthesis for reachability. In Proceedings of the 10th International Conference on Embedded software, pages 19--28, 2010. Google ScholarDigital Library
- C. Tomlin, G. J. Pappas, and S. Sastry. Conflict resolution for air traffic management: A study in muti-agent hybrid systems. IEEE Transactions on Automatic Control, 43(4):509--521, 1998.Google ScholarCross Ref
Index Terms
- Formal verification of hybrid systems
Recommendations
Time-aware relational abstractions for hybrid systems
EMSOFT '13: Proceedings of the Eleventh ACM International Conference on Embedded SoftwareHybrid Systems model both discrete switches and continuous dynamics and are suitable to represent embedded systems where discrete controllers interact with a physical plant.
Relational abstraction is a new approach for verifying hybrid systems. In ...
A formal requirements engineering method for specification, synthesis, and verification
SEE '97: Proceedings of the 8th International Conference on Software Engineering Environments (SEE '97)This paper presents a formal requirements engineering method capturing specification, synthesis, and verification. Being multi-paradigm, our approach integrates individual established formal methods: temporal logics are used to express abstract ...
Formal verification in hardware design: a survey
In recent years, formal methods have emerged as an alternative approach to ensuring the quality and correctness of hardware designs, overcoming some of the limitations of traditional validation techniques such as simulation and testing.
There are two ...
Comments