On the satisfiability of indexed linear temporal logics

DOI10.4230/LIPICS.CONCUR.2015.254MaRDI QIDQ5357708zbMATH OpenFDO

Authors Taolue Chen, Fu Song, Zhilin Wu

Publication date 12 September 2017

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2015.254

zbMATH Keywords

indexed linear temporal logicparameterised systemssatisfiability

Mathematics Subject Classification ID

Temporal logic (03B44) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The Complexity of Generalized Satisfiability for Linear Temporal Logic
• Temporal logics with local constraints (invited talk)
• The complexity of propositional linear temporal logics in simple cases
• The complexity of propositional linear temporal logics
• On temporal logics with data variable quantifications: decidability and complexity

Cited in

(3)

• A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
• Enhancing unsatisfiable cores for LTL with information on temporal relevance
• On the Satisfiability and Model Checking for one Parameterized Extension of Linear-time Temporal Logic

This page was built for publication: On the satisfiability of indexed linear temporal logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5357708)