The complexity of counting models of linear-time temporal logic



Torfah, H and Zimmermann, M ORCID: 0000-0002-8038-2453
(2014) The complexity of counting models of linear-time temporal logic. .

[img] Text
tz.pdf - OA Published Version

Download (518kB) | Preview

Abstract

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 in unary, and as hard as counting accepting runs of nondeterministic polynomial space Turing machines, if the bound is given in binary. Counting tree-models is as hard as counting accepting runs of nondeterministic exponential time Turing machines, if the bound is given in unary. For a binary encoding of the bound, the problem is at least as hard as counting accepting runs of nondeterministic exponential space Turing machines. On the other hand, it is not harder than counting accepting runs of nondeterministic doubly-exponential time Turing machines.

Item Type: Conference or Workshop Item (Unspecified)
Depositing User: Symplectic Admin
Date Deposited: 15 Jul 2019 12:58
Last Modified: 25 Nov 2021 15:10
DOI: 10.4230/LIPIcs.FSTTCS.2014.241
URI: https://livrepository.liverpool.ac.uk/id/eprint/3049681