3 citations · 3 across the 5 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2013
On the Complexity of Verifying Regular Properties on Flat Counter Systems
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Among the approximation methods for the verification of counter systems, one of them consists in model-checking their flat unfoldings. Unfortunately, the complexity characterizatio…
cs.LO2012
Taming Past LTL and Flat Counter Systems
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…