Optimizing Bounded Model Checking for Linear Hybrid Systems

Ábrahám, Erika; Becker, Bernd; Klaedtke, Felix; Steffen, Martín

doi:10.1007/978-3-540-30579-8_26

Cited by 15 publications

(18 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The transition relation captures two cases: discrete jumps and continuous flows, that must both be represented in the BMC encodings. For a detailed description of the encodings and optimizations see [3].…”

Section: Linear Hybrid Automatamentioning

confidence: 99%

See 1 more Smart Citation

Bounded Model Checking with Parametric Data Structures

Ábrahám

Herbstritt

Becker

et al. 2007

Electronic Notes in Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like timed automata or linear hybrid automata. Counterexamples of a fixed length are described by formulas in a decidable logic, and checked for satisfiability by a suitable solver.In an earlier paper we analyzed how BMC of linear hybrid automata can be accelerated already by appropriate encoding of counterexamples as formulas and by selective conflict learning. In this paper we introduce parametric datatypes for the internal solver structure that, taking advantage of the symmetry of BMC problems, remarkably reduce the memory requirements of the solver.

show abstract

Section: Linear Hybrid Automatamentioning

confidence: 99%

“…In an earlier paper [3] we concentrated on how BMC of linear hybrid automata can be accelerated by appropriate encoding of counterexamples as formulas, and by selective conflict learning. Those techniques were introduced in order to improve the CPU running times.…”

Section: Introductionmentioning

confidence: 99%

Bounded Model Checking with Parametric Data Structures

Ábrahám

Herbstritt

Becker

et al. 2007

Electronic Notes in Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…the locations and the discrete transitions) can be easily encoded in S. Here, we do not give the details of the encoding of the discrete locations and discrete transitions of H (see [30,1] for examples of this encoding). In fact, we assume we have a one-to-one mapping between the discrete locations and the discrete transitions of the hybrid automaton and their encoding in the transition system S. (Intuitively, S has a copy of the discrete structure of H).…”

Section: Smt-based Verification Of Hybrid Automatamentioning

confidence: 99%

“…the flow condition µ) is more complex, since it requires to have an explicit solution to the differential equations and to faithfully encode the invariants during the continuous evolution. In practice, the precise encoding can be done only for some very restrictive sub-classes of Linear Hybrid Systems [30,14,1,11]. By compromising precision, relational abstraction provides a general way to encode the continuous dynamics µ for any Linear Hybrid System.…”

Section: Smt-based Verification Of Hybrid Automatamentioning

confidence: 99%

See 1 more Smart Citation

Time-aware relational abstractions for hybrid systems

Mover

Cimatti

Tiwari

et al. 2013

2013 Proceedings of the International Conference on Embedded Software (EMSOFT)

View full text Add to dashboard Cite

Hybrid 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 relational abstraction, the continuous dynamics in each location of the hybrid system is abstracted by a binary relation that relates the current value of the continuous variables with all future values of the variables that are reachable after a time elapse (continuous) transition. The abstract system is an infinite-state system, which can be verified using k-induction or abstract interpretation.Existing techniques for computing relational abstractions are time-agnostic: they do not construct any relationship between the state variables and the time elapsed during the continuous evolution. Time-agnostic abstractions cannot verify timing properties.We present a technique to compute a time-aware relational abstraction for verifying (timing-related) safety properties of cyber-physical systems. We show the effectiveness of the new abstraction on several case studies on which the previous techniques fail.

show abstract