The complexity of propositional linear temporal logics
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
- Optimal bounds in parametric LTL games
- Team semantics for the specification and verification of hyperproperties
- Parametrised complexity of satisfiability in temporal logic
- Set semantics for asynchronous TeamLTL: expressivity and complexity
- A general notion of uniform strategies
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
- A two-level temporal logic for evolving specifications.
- Unification in linear temporal logic LTL
- Deciding safety and liveness in TPTL
- A multiprocess network logic with temporal and spatial modalities
- Synthesis from component libraries with costs
- A unified approach for showing language inclusion and equivalence between various types of -automata
- Backdoors for linear temporal logic
- AN NP-COMPLETE FRAGMENT OF LTL
- Matching Trace Patterns with Regular Policies
- Extracting unsatisfiable cores for LTL via temporal resolution
- Alternating automata: unifying truth and validity checking for temporal logics
- Removing irrelevant information in temporal resolution proofs
- Satisfiability checking for mission-time \textsf{LTL} (MLTL)
- Backdoors for linear temporal logic
- Developments in Language Theory
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Automata theory and model checking
- The complexity of clausal fragments of LTL
- Relating word and tree automata
- Linear temporal logic with until and next, logical consecutions
- The Birth of Model Checking
- The computational complexity of scenario-based agent verification and design
- -automata
- Bounded linear-time temporal logic: a proof-theoretic investigation
- Temporal BI: proof system, semantics and translations
- Some simulation results as to weakly correlated processes
- Automated temporal reasoning about reactive systems
- Probabilistic temporal logic with countably additive semantics
- Size-change termination and satisfiability for linear-time temporal logics
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- scientific article; zbMATH DE number 7561320 (Why is no real title available?)
- Interrupt timed automata: verification and expressiveness
- Constraint LTL satisfiability checking without automata
- On the Decision Problem for Two-Variable First-Order Logic
- Iterated Boolean games
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- A general tableau method for propositional interval temporal logics: theory and implementation
- A temporal negative normal form which preserves implicants and implicates
- Multi-player games with LDL goals over finite traces
- Complete problems in the first-order predicate calculus
- Some Complexity Results for SystemVerilog Assertions
- Complexity of monodic guarded fragments over linear and real time
- Reasoning about Conditions and Exceptions to Laws in Regulatory Conformance Checking
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Generalized modal satisfiability
- Temporal stream logic modulo theories
- A survey on temporal logics for specifying and verifying real-time systems
- Probabilistic temporal reasoning using superposition semantics
- The complexity of temporal logic over the reals
- Efficient timed model checking for discrete-time systems
- Sublogics of a branching time logic of robustness
- Temporal logics over linear time domains are in PSPACE
- Reasoning about networks with many identical finite state processes
- Weak completeness theorem for propositional linear time temporal logic
- An explicit transition system construction approach to LTL satisfiability checking
- On the satisfiability of indexed linear temporal logics
- Temporal logics over linear time domains are in PSPACE
- An automata-theoretic approach to constraint LTL
- Embedding theorems for LTL and its variants
- Characterizing finite Kripke structures in propositional temporal logic
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
- Reasoning about sequences of memory states
- On relative and probabilistic finite counterability
- The complexity of counting models of linear-time temporal logic
- The complexity of counting models of linear-time temporal logic
- LARS: a logic-based framework for analytic reasoning over streams
- Weak Kripke structures and LTL
- Interval temporal logic model checking: the border between good and bad HS fragments
- scientific article; zbMATH DE number 3995647 (Why is no real title available?)
- Reasoning about action in polynomial time
- Belief, awareness, and limited reasoning
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata
- Complexity and Succinctness Issues for Linear-Time Hybrid Logics
- Interval vs. point temporal logic model checking. An expressiveness comparison
- Deciding Robustness against Total Store Ordering
- Spanning the spectrum from safety to liveness
- scientific article; zbMATH DE number 7056237 (Why is no real title available?)
- scientific article; zbMATH DE number 5270677 (Why is no real title available?)
- Module checking
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Verification of qualitative \(\mathbb Z\) constraints
- The stuttering principle revisited
- Satisfaction degree for a class of temporal logic formulae based on transition systems
- An approach to infinitary temporal proof theory
- A Paraconsistent Linear-time Temporal Logic
- Effective characterizations of simple fragments of temporal logic using Carton-Michel automata
- Tableau-based automata construction for dynamic linear time temporal logic
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
- A note on a question of Peled and Wilke regarding stutter-invariant LTL
- scientific article; zbMATH DE number 2032380 (Why is no real title available?)
- The logic of ``initially and ``next: complete axiomatization and complexity
- Modular model checking
This page was built for publication: The complexity of propositional linear temporal logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769957)
