Reachability for two-counter machines with one test and one reset (Q5090970)
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 7561336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability for two-counter machines with one test and one reset |
scientific article; zbMATH DE number 7561336 |
Statements
21 July 2022
0 references
counter machine
0 references
vector addition system
0 references
reachability problem
0 references
formal verification
0 references
Presburger arithmetic
0 references
infinite-state system
0 references
0 references
0.7624505758285522
0 references
0.7535156011581421
0 references
0.7460587024688721
0 references
