The complexity of propositional linear temporal logics in simple cases
type: Item
instance of: scholarly article
title: The complexity of propositional linear temporal logics in simple cases
zbMATH Open document ID: 1009.68072
author: Philippe Schnoebelen
author: Stéphane Demri
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 1853252
describes a project that uses: SPIN
MaRDI profile type: Publication
OpenAlex ID: W2026379532
cites work: Characterizing finite Kripke structures in propositional temporal logic
cites work: An algebraic study of Diodorean modal systems
cites work: The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
cites work: Q2753678
cites work: The complexity of theorem-proving procedures
cites work: Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
cites work: Q4381382
cites work: Q4945225
cites work: Q4952323
cites work: The complexity of concept languages
cites work: Q4385542
cites work: Modalities for model checking: Branching time logic strikes back
cites work: Cut-free sequent and tableau systems for propositional Diodorean modal logics
cites work: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
cites work: The propositional dynamic logic of deterministic, well-structured programs
cites work: Recurring Dominoes: Making the Highly Undecidable Highly Understandable
cites work: Space-bounded reducibility among combinatorial problems
cites work: Q2771058
cites work: Specification in CTL + past for verification in CTL.
cites work: Log Space Recognition and Translation of Parenthesis Languages
cites work: Q4002642
cites work: Hierarchical verification of asynchronous circuits using temporal logic
cites work: On the size of refutation Kripke models for some linear modal and tense logics
cites work: Q4298260
cites work: The logic of ``initially'' and ``next'': complete axiomatization and complexity
cites work: Q4068699
cites work: The complexity of propositional linear temporal logics
cites work: Q4833777
cites work: Temporal logic can be more expressive
DOI: 10.1006/INCO.2001.3094
description: scientific article; zbMATH DE number 1853252