English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space

MPS-Authors
/persons/resource/persons44687

Jacobs,  Swen
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45689

Waldmann,  Uwe
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Damm, W., Disch, S., Hungar, H., Jacobs, S., Pang, J., Pigorsch, F., et al. (2007). Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space. In K. S. Namjoshi, T. Yoneda, T. Higashino, & Y. Okamura (Eds.), Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007 (pp. 425-440). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1F25-5
Abstract
We propose algorithms significantly extending the limits for maintaining exact representations in the verification of linear hybrid systems with large discrete state spaces. We use AND-Inverter Graphs (AIGs) extended with linear constraints (LinAIGs) as symbolic representation of the hybrid state space, and show how methods for maintaining compactness of AIGs can be lifted to support model-checking of linear hybrid systems with large discrete state spaces. This builds on a novel approach for eliminating sets of redundant constraints in such rich hybrid state representations by a suitable exploitation of the capabilities of SMT solvers, which is of independent value beyond the application context studied in this paper. We used a benchmark derived from an Airbus flap control system (containing $2^{20}$ discrete states) to demonstrate the relevance of the approach.