The complexity of propositional linear temporal logics
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Developing bounded reasoning
- Before and after vacuity
- Dual systems of tableaux and sequents for PLTL
- Systems of agents controlled by logical programs: complexity of verification
- Complexity and succinctness issues for linear-time hybrid logics
- A multiprocess network logic with temporal and spatial modalities
- Process logic with regular formulas
- Complete problems in the first-order predicate calculus
- The complementation problem for Büchi automata with applications to temporal logic
- Belief, awareness, and limited reasoning
- Some simulation results as to weakly correlated processes
- A decision procedure for combinations of propositional temporal logic and other specialized theories
- Satisfiability in many-valued sentential logic is NP-complete
- The complexity of reasoning about knowledge and time. I: Lower bounds
- Problems concerning fairness and temporal logic for conflict-free Petri nets
- Characterizing finite Kripke structures in propositional temporal logic
- TABLEAUX: A general theorem prover for modal logics
- A model checker for linear time temporal logic
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
- An algorithmic approach for checking closure properties of temporal logic specifications and -regular languages
- A modal perspective on the computational complexity of attribute value grammar
- A branching time logic with past operators
- Safety, liveness and fairness in temporal logic
- The power of the ``always operator in first-order temporal logic
- On projective and separable properties
- Verification of relational transducers for electronic commerce
- The complexity of the temporal logic with ``until over general linear time
- On feasible cases of checking multi-agent systems behavior.
- Spanning the spectrum from safety to liveness
- Parameterized model checking of rendezvous systems
- Imperfect information in reactive modules games
- LARS: a logic-based framework for analytic reasoning over streams
- Finite-trace linear temporal logic: coinductive completeness
- An explicit transition system construction approach to LTL satisfiability checking
- A first-order coalition logic for BDI-agents
- Backdoors for linear temporal logic
- Model checking properties on reduced trace systems
- Sublogics of a branching time logic of robustness
- On relative and probabilistic finite counterability
- The complexity of counting models of linear-time temporal logic
- An approach to infinitary temporal proof theory
- Difficult configurations -- on the complexity of LTrL
- Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
- Diagnosability of repairable faults
- The price of universality
- Minimal temporal epistemic logic
- Product interval automata
- A two-level temporal logic for evolving specifications.
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
- Module checking
- The complexity of propositional linear temporal logics in simple cases
- Is your model checker on time? On the complexity of model checking for timed modal logics
- Vectorial languages and linear temporal logic
- Past is for free: On the complexity of verifying linear temporal properties with past
- Verification of a technical system model with linear temporal logic
- Some results on parametric temporal logic
- Temporal aspects of the modal logic of subset spaces
- Using temporal logics to express search control knowledge for planning
- Reasoning about action in polynomial time
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
- Temporal logic with recursion
- -automata
- Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models
- Satisfiability checking for mission-time \textsf{LTL} (MLTL)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata
- Social bot detection as a temporal logic model checking problem
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- On the complexity of linear temporal logic with team semantics
- Multi-player games with LDL goals over finite traces
- Theorem proving for pointwise metric temporal logic over the naturals via translations
- Epistemic GDL: a logic for representing and reasoning about imperfect information games
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Strategic reasoning with a bounded number of resources: the quest for tractability
- Transformation from PLTL to automata via NFGs
- On the expressiveness of TPTL and MTL
- Verification of concurrent programs: The automata-theoretic framework
- Model checking Petri nets with MSVL
- A novel approach to verifying context free properties of programs
- Model checking for hybrid branching-time logics
- Computational complexity of core fragments of modal logics \(\mathrm{t}\), \(\mathrm{K4}\), and \(\mathrm{S4}\)
- Synthesis from hyperproperties
- Iterated Boolean games
- Taming past LTL and flat counter systems
- Qualitative analysis of gene regulatory networks by temporal logic
- Efficient timed model checking for discrete-time systems
- The computational complexity of scenario-based agent verification and design
- Complexity results on branching-time pushdown model checking
- A brief account of runtime verification
- The power of first-order quantification over states in branching and linear time temporal logics
- From model checking to equilibrium checking: reactive modules for rational verification
- Bounded variability of metric temporal logic
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- A survey on temporal logics for specifying and verifying real-time systems
- A propositional linear time logic with time flow isomorphic to ^2
- Probabilistic verification and approximation
- The stuttering principle revisited
- A parametric analysis of the state-explosion problem in model checking
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
- The complexity of agent design problems: Determinism and history dependence
- LTL over integer periodicity constraints
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)
