Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.scico.2011.07.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.SCICO.2011.07.006 / rank | |||
Normal rank | |||
Latest revision as of 17:32, 9 December 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
0 references
0 references
