Tool-support for the analysis of hybrid systems and models

@article{Bauer2007ToolsupportFT,
  title={Tool-support for the analysis of hybrid systems and models},
  author={Andreas Bauer and Markus Pister and Michael Tautschnig},
  journal={2007 Design, Automation \& Test in Europe Conference \& Exhibition},
  year={2007},
  pages={1-6}
}
This paper introduces a method and tool-support for the automatic analysis and verification of hybrid and embedded control systems, whose continuous dynamics are often modelled using MATLAB/Simulink. The method is based upon converting system models into the uniform input language of our efficient multi-domain constraint solving library, ABSOLVER, which is then used for subsequent analysis. Basically, ABSOLVER is an extensible SMT-solver which addresses mixed Boolean and (nonlinear) arithmetic… 

Figures and Tables from this paper

SAT-Modulo-Theory based Analysis of Probabilistic Hybrid Systems

The framework of hybrid discrete-continuous systems becomes increasingly popular for modeling and verifying large real-world, often safety-critical, embedded systems, e.g. in the car and aviation

Automated generation of hybrid automata for multi-rigid-body mechanical systems and its application to the falsification of safety properties

The proposed modelling framework is well suited for the automated verification of dynamical properties of realistic mechanical systems and is shown by the falsification of safety properties over the transition system generated by DyverseRBT.

Falsification of Safety Properties in Multi-Rigid-Body Mechanical Systems with Hybrid Automata and Constraint Satisfaction

The problem of automatically falsifying safety properties in multirigid-body systems with multiple impacts and friction is considered, and the design and implementation of the Dyverse Bounded Model Checker (DyverseBMC) is considered.

Challenges in Constraint-Based Analysis of Hybrid Systems

An extension of iSAT to directly handle ordinary differential equations as constraints as constraints is proposed and ideas on how to move from bounded to unbounded model checking by using the concept of interpolation are presented.

Solving Nonlinear SMT Problems Based on an Efficient Lazy Method

This paper presents an efficient method to solve Boolean combinations of nonlinear numerical constraints under the lazy SMT framework that combines an iterative optimization method and interval analysis together to solve numerical constraints.

A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra

The goal of this work is to develop an SMT-solver for the real algebra, which is both complete and efficient for real algebra.

Analysis of Hybrid Systems Using HySAT

In this paper we describe the complete workflow of analyzing the dynamic behavior of safety-critical embedded systems with HySAT. HySAT is an arithmetic constraint solver with a tightly integrated

Randomized constraint solvers: a comparative study

Several randomized solvers are proposed and evaluated to address the complexity of constraints and it is observed that the solvers were complementary, which suggests that one should alternate their use in iterations of a concolic execution driver.

Don’t care in SMT: building flexible yet efficient abstraction/refinement solvers

This paper describes a method for combining “off-the-shelf” SAT and constraint solvers for building an efficient Satisfiability Modulo Theories (SMT) solver for a wide range of theories and shows that it results in considerably smaller and less complex constraint problems.
...

References

SHOWING 1-10 OF 13 REFERENCES

A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems

A method for solving Mixed Logical/ Integer Linear Programming (MLILP) problems that integrates a polynomial-time ILP solver for the special class of Unit-Two-Variable-Per-Inequality constraints of the form ax + by ≤ d into generic Boolean SAT solvers.

An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic

A new decision procedure for the satisfiability of Linear Arithmetic Logic (LAL), i.e. boolean combinations of propositional variables and linear constraints over numerical variables, based on the well known integration of a propositional SAT procedure with theory deciders enhanced in the following ways.

Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles

The chosen approach is twofold: the problem of contradicting first order system descriptions with a set of observations is reduced to propositional logic using the notion of symptoms, and the determination of conflict sets and minimal diagnoses is mapped to a problem whose technical solution has experienced a sheer boost over the past years, namely k-satisfiability using state-of-the-art SAT-solvers.

From simulink to SCADE/lustre to TTA: a layered approach for distributed embedded applications

We present a layered end-to-end approach for the design and implementation of embedded software on a distributed platform. The approach comprises a high-level modeling and simulation layer

Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems

This year's LCTES'03 program spans some of the many topics that are critical to the design of hardware and software systems for embedded systems; especially how to meet performance requirements with the often limited resources at hand.

The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community

The Common Optimization INterface for Operations Research, an initiative to promote open-source software for the operations research community, is reviewed, and the goals and status of COIN-OR are presented.

Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence

Under mild assumptions it is shown that every limit point of the sequence of iterates generated by the algorithm is feasible, and that there exists at least one limit point that is a stationary point for the problem under consideration.

CVC Lite: A New Implementation of the Cooperating Validity Checker Category B

We describe a tool called CVC Lite (CVCL), an automated theorem prover for formulas in a union of first-order theories. CVCL supports a set of theories which are useful in verification, including

Sudoku as a SAT Problem

This paper addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques, and introduces two straightforward SAT encodings for Sudoku: the minimal encoding and the extended encoding.

The SMT-LIB Standard: Version 1.2

This paper defines syntax and semantics of the language used by SMT-LIB for writing theory specifications and benchmarks.