Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CLN / rank | |||
Normal rank | |||
Revision as of 00:19, 1 March 2024
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
