The Complexity of Propositional Linear Temporal Logics in Simple Cases

Stéphane Demri, Philippe Schnoebelen
<span title="">2002</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Information and Computation</a> </i> &nbsp;
It is well-known that model checking and satisfiability for PLTL are PSPACE-complete. By contrast, very little is known about whether there exist some interesting fragments of PLTL with a lower worst-case complexity. Such results would help understand why PLTL model checkers are successfully used in practice. In this paper we investigate this issue and consider model checking and satisfiability for all fragments of PLTL obtainable by restricting (1) the temporal connectives allowed, (2) the
more &raquo; ... er of atomic propositions, and (3) the temporal height.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1006/inco.2001.3094</a> <a target="_blank" rel="external noopener" href="">fatcat:22u24aacr5ax5bybc2p7bavc64</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / </button> </a>