Language Based Abstraction Refinement for Hybrid System Verification
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F07%3A00339925" target="_blank" >RIV/67985807:_____/07:00339925 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Language Based Abstraction Refinement for Hybrid System Verification
Original language description
The standard counterexample-guided abstraction-refinement (CEGAR) approach uses finite transition systems as abstractions of concrete systems. We present an approach to represent and refine abstractions of infinite-state systems. Instead of using finitetransition systems we use regular languages. The advantage of languages over transition systems is that we can store more fine-grained information in the abstraction and thus reduce the number of abstract states. Based on this language-based approach forCEGAR, we present new abstraction-refinement algorithms for hybrid system verification. Moreover, we evaluate our approach by verifying various non-linear hybrid systems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Verification, Model Checking, and Abstract Interpretation
ISBN
978-3-540-69735-0
ISSN
—
e-ISSN
—
Number of pages
16
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Nice
Event date
Jan 14, 2007
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000244555600011