8 citations · 22 across the 17 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
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…
cs.LO2012★ 2 cited
The Cost of Parameterized Reachability in Mobile Ad Hoc Networks
Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso +1
We investigate the impact of spontaneous movement in the complexity of verification problems for an automata-based protocol model of networks with selective broadcast communication…