25 citations · 56 across the 15 of their papers we have counts for
1 paper · 1 filter
Hazem Torfah, Martin Zimmermann
We determine the complexity of counting models of bounded size of specifications expressed in Linear-time Temporal Logic. Counting word models is #P-complete, if the bound is given…