Sciweavers

CADE
2012
Springer
12 years 2 months ago
Taming Past LTL and Flat Counter Systems
Abstract. 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 c...
Stéphane Demri, Amit Kumar Dhar, Arnaud San...