Reachability results for timed automata with unbounded data structures (Q707597)
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: Reachability results for timed automata with unbounded data structures |
scientific article; zbMATH DE number 5797365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability results for timed automata with unbounded data structures |
scientific article; zbMATH DE number 5797365 |
Statements
Reachability results for timed automata with unbounded data structures (English)
0 references
8 October 2010
0 references
systems of data management timed automata
0 references
0 references
0.7796462178230286
0 references
0.779646098613739
0 references
0.7757200002670288
0 references
0.7653378844261169
0 references
