Linear reachability problems and minimal solutions to linear Diophantine equation systems (Q703515)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2126093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear reachability problems and minimal solutions to linear Diophantine equation systems |
scientific article; zbMATH DE number 2126093 |
Statements
Linear reachability problems and minimal solutions to linear Diophantine equation systems (English)
0 references
11 January 2005
0 references
Model-checking
0 references
Timed automata
0 references
Reachability
0 references
Linear Diophantine equation systems
0 references
Minimal solutions
0 references
0 references
0 references
0.9341862797737122
0 references
0.7340983748435974
0 references
0.7290311455726624
0 references
0.7257834076881409
0 references
