Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces |
scientific article |
Statements
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (English)
0 references
20 July 2012
0 references
verification
0 references
linear hybrid automata
0 references
symbolic representations
0 references
non-convex polyhedra
0 references
redundancy elimination
0 references
satisfiability modulo theories (SMT)
0 references
