Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata (Q2986719)
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: Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata |
scientific article |
Statements
Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata (English)
0 references
16 May 2017
0 references
deterministic discrete transition
0 references
linear hybrid automata
0 references
reachability
0 references
transversal discrete transition
0 references
0.8818462
0 references
0.8787184
0 references
0.87065256
0 references
0.8638583
0 references
0.8630983
0 references
0.8617207
0 references
0.85978895
0 references
