Abstract
Bounded model checking (BMC) is well-known to be undecidable even for simple hybrid systems. Existing work targeted for a wide class of non-linear hybrid systems reduces the BMC problem to the satisfiability problem of an satisfiability modulo theory formula encoding the hybrid system dynamics. Consequently, the satisfiability of the formula is deduced with a δ-decision procedure. However, the encoded formula can be complex for large automaton and for deep exploration causing the decision procedure to be inefficient. Additionally, a generalized decision procedure can be inefficient for hybrid systems with simple dynamics. In this article, we propose a BMC algorithm built upon the foundation of the counter example guided abstraction refinement (CEGAR) technique and targeted for hybrid systems with piecewise affine dynamics, modeled as a hybrid automaton. In particular, our algorithm begins by searching an abstract counterexample in the discrete state-space of the automaton. We check whether a discovered abstract counterexample is spurious or real by a two-tier refinement of the state-space guided by the abstract counterexample. The primary refinement is through symbolic reachability analysis and the following refinement is via a search of a real counterexample by the trajectory splicing method, guided in turn by the outcome of reachability analysis. We show that our algorithm reaps the benefits of the CEGAR technique by directing the exploration in the regions of interest and pruning search space that is irrelevant to the property under consideration. In addition, an optimization by memoizing the computed symbolic states during reachability analysis has been proposed for efficiency. The proposed algorithm is implemented in the tool SAT-Reach, and we compare its performance with dReach, XSpeed, Flow*, SpaceEx, and a pattern database heuristic-guided search algorithm. Experiments demonstrate the efficacy of our algorithm.
- [1] . 1995. The algorithmic analysis of hybrid systems. Theoretical Computer Science 138, 1 (1995), 3–34.Google Scholar
Digital Library
- [2] . 1992. Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems. Springer-Verlag, 209–229.Google Scholar
- [3] . 2016. Planning on discrete events systems: A logical approach. In Proceedings of the IEEE International Conference on Automation Science and Engineering. IEEE, 1055–1060.
DOI: Google ScholarDigital Library
- [4] . 2005. Verifying industrial hybrid systems with MathSAT. Electronic Notes in Theoretical Computer Science 119, 2 (2005), 17–32.Google Scholar
Digital Library
- [5] . 2019. Revisiting polyhedral analysis for hybrid systems. In Static Analysis - 26th International Symposium, SAS 2019, Porto, Portugal, October 8-11, 2019, Proceedings (Lecture Notes in Computer Science), (Ed.), Vol. 11822. Springer, 183–202.
DOI: Google ScholarDigital Library
- [6] . 2015. Networked cooperative platoon of vehicles for testing methods and verification tools. In Proceedings of the ARCH14-15. 1st and 2nd International Workshop on Applied veRification for Continuous and Hybrid Systems. 37–42.Google Scholar
- [7] . 2003. Bounded model checking. Advanced Computing 58 (2003), 117–148.
DOI: Google ScholarCross Ref
- [8] . 2016. Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer 18, 4 (2016), 449–467.
DOI: Google ScholarDigital Library
- [9] . 2019. Falsification of hybrid systems using symbolic reachability and trajectory splicing. In Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, and (Eds.). ACM, 1–10.
DOI: Google ScholarDigital Library
- [10] . 2020. ARCH-COMP20 category report: Hybrid systems with piecewise constant dynamics and bounded model checking. In Proceedings of the ARCH20. 7th International Workshop on Applied Verification of Continuous and Hybrid Systems. EasyChair, 1–15.
DOI: Google ScholarCross Ref
- [11] . 2016. A compilation of the full PDDL+ language into SMT. In Proceedings of the 26th International Conference on International Conference on Automated Planning and Scheduling. AAAI Press, 79–87. Google Scholar
Cross Ref
- [12] . 2013. Flow*: An analyzer for non-linear hybrid systems. In Proceedings of the International Conference on Computer Aided Verification. Springer, 258–263.Google Scholar
Cross Ref
- [13] . 2015. Flow* 1.2: More effective to play with hybrid systems. In 1st and 2nd International Workshop on Applied veRification for Continuous and Hybrid Systems (EPiC Series in Computing), and (Eds.), Vol. 34. EasyChair, 152–159.
DOI: Google ScholarCross Ref
- [14] . 2000. Counterexample-guided abstraction refinement. In Proceedings of the CAV (Lecture Notes in Computer Science), and (Eds.), Vol. 1855. Springer, 154–169. Google Scholar
Cross Ref
- [15] . 2003. Counterexample-guided abstraction refinement for symbolic model checking. Journal of the ACM 50, 5 (2003), 752–794.
DOI: Google ScholarDigital Library
- [16] . 2004. SAT-based counterexample-guided abstraction refinement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 23, 7 (2004), 1113–1123.
DOI: Google ScholarDigital Library
- [17] . 1962. A machine program for theorem-proving. Communications of the ACM 5, 7 (1962), 394–397.Google Scholar
Digital Library
- [18] . 2008. Z3: An efficient SMT solver. In Proceeedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, 337–340.Google Scholar
Cross Ref
- [19] . 2008. SAT modulo ODE: A direct SAT approach to hybrid systems. In Proceedings of the International Symposium on Automated Technology for Verification and Analysis. Springer, 171–185.Google Scholar
Digital Library
- [20] . 2011. Improving SAT modulo ODE for hybrid systems analysis by combining different enclosure methods. In Proceedings of the International Conference on Software Engineering and Formal Methods. Springer, 172–187.Google Scholar
Cross Ref
- [21] . 2004. Benchmarks for hybrid systems verification. In Proceedings of the HSCC (Lecture Notes in Computer Science), and (Eds.), Vol. 2993. Springer, 326–341. Google Scholar
Cross Ref
- [22] Maria Fox and Derek Long. 2006. Modelling mixed discrete-continuous domains for planning. Journal of Artificial Intelligence Research 27, 1 (2006), 235–297.Google Scholar
- [23] . 2005. Efficient proof engines for bounded model checking of hybrid systems. Electronic Notes in Theoretical Computer Science 133, 133 (2005), 119–137.
DOI: Google Scholar Digital Library
- [24] . 2008. PHAVer: Algorithmic verification of hybrid systems past HyTech. International Journal on Software Tools for Technology Transfer 10, 3 (2008), 263–279.
DOI: Google ScholarCross Ref
- [25] . 2019. ARCH-COMP19 category report: Hybrid systems with piecewise constant dynamics. In Proceedings of the ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systemsi, part of CPS-IoT Week 2019, and (Eds.), Vol. 61. EasyChair, 1–13.
DOI: Google ScholarCross Ref
- [26] . 2011. SpaceEx: Scalable verification of hybrid systems. In Proceedings of the 23rd International Conference on Computer Aided Verification, (Ed.). Springer.Google Scholar
Cross Ref
- [27] . 2012. Delta-decidability over the reals. In Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS’12). IEEE Computer Society, 305–314.
DOI: Google ScholarDigital Library
- [28] . 2005. Bounded model checking of hybrid dynamical systems. In Proceedings of the 44th IEEE Conference on Decision and Control. 672–677.Google Scholar
Cross Ref
- [29] . 2000. The theory of hybrid automata. In Proceedings of the Verification of Digital and Hybrid Systems. Springer, 265–292.Google Scholar
Cross Ref
- [30] . 2001. Stability of limit cycles in hybrid systems. In Proceedings of the 34th Annual Hawaii International Conference on System Sciences. IEEE Computer Society.
DOI: Google ScholarCross Ref
- [31] . 2007. Reachability for linear hybrid automata using iterative relaxation abstraction. In Proceedings of the 10th International Workshop on Hybrid Systems: Computation and Control,, , and (Eds.), Vol. 4416. Springer, 287–300.
DOI: Google ScholarCross Ref
- [32] . [n.d.]. The NLopt nonlinear-optimization package. Retrieved from http://ab-initio.mit.edu/nlopt.Google Scholar
- [33] . 2015. dReach: \(\delta\)-reachability analysis for hybrid systems. In Proceedings of the 21st International Conference onTools and Algorithms for the Construction and Analysis of Systems: Held as Part of the European Joint Conferences on Theory and Practice of Software. Springer, 200.Google Scholar
Digital Library
- [34] . 2018. Tropical abstractions of max-plus linear systems. In Proceedings of the 16th International Conference on Formal Modeling and Analysis of Timed Systems, Proceedings (Lecture Notes in Computer Science), and (Eds.), Vol. 11022. Springer, 271–287.
DOI: Google ScholarCross Ref
- [35] . 2015. XSpeed: Accelerating reachability analysis on multi-core processors. In Proceedings of the 11th International Haifa Verification Conference Hardware and Software: Verification and Testing HVC 2015, Proceedings (Lecture Notes in Computer Science), (Ed.), Vol. 9434. Springer, 3–18.
DOI: Google ScholarCross Ref
- [36] . 2009. Artificial Intelligence: A Modern Approach (3rd Ed.). Prentice Hall Press. Google Scholar
- [37] . 2018. Efficient dynamic error reduction for hybrid systems reachability analysis. In Proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part II (Lecture Notes in Computer Science), and (Eds.), Vol. 10806. Springer, 287–302.
DOI: Google ScholarCross Ref
- [38] . 1987. The method of moving asymptotes—a new method for structural optimization. International Journal for Numerical Methods in Engineering 24, 2 (1987), 359–373.Google Scholar
Cross Ref
- [39] . 2000. Computable Analysis - An Introduction. Springer.
DOI: Google ScholarCross Ref
- [40] . 2014. SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata. Formal Methods in System Design 45, 1 (2014), 42–62.
DOI: Google ScholarDigital Library
- [41] . 2013. A trajectory splicing approach to concretizing counterexamples for hybrid systems. In Proceedings of the 52nd IEEE Conference on Decision and Control, CDC 2013. IEEE, 3918–3925.
DOI: Google ScholarCross Ref
Index Terms
SAT-Reach: A Bounded Model Checker for Affine Hybrid Systems
Recommendations
SAT-solving in CSP trace refinement
In this paper, we address the problem of applying SAT-based bounded model checking (BMC) and temporal k-induction to asynchronous concurrent systems. We investigate refinement checking in the process-algebraic setting of Communicating Sequential ...
A Bounded Model Checker for Timed Automata and Its Application to LTL Properties
AbstractModel checking with a time aspect is often used in verification on hardware and embedded systems. Timed automata are often used for such models. UPPAAL is a world-wide famous model checking tool for timed automata; however, UPPAAL is a ...
Bounded model checking of high-integrity software
HILT '13: Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technologyModel checking [5] is an automated algorithmic technique for exhaustive verification of systems, described as finite state machines, against temporal logic [9] specifications. It has been used successfully to verify hardware at an industrial scale [6]. ...






Comments