3 citations · 3 across the 5 of their papers we have counts for
1 paper · 1 filter
Stéphane Demri, Amit Kumar Dhar, Arnaud sangnier
Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known complexity u…