Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness

DOI10.1007/978-3-540-74407-8_7MaRDI QIDQ3525631zbMATH OpenOpenAlexFDO

Authors Martin Lange

Publication date 18 September 2008

Published in CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74407-8_7

Mathematics Subject Classification ID

Temporal logic (03B44) 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

• On regular temporal logics with past
• Formal Methods in Computer-Aided Design
• The complexity of propositional linear temporal logics
• On the expressive power of temporal logic
• Temporal logic can be more expressive

Cited in

(10)

• Temporal logic with recursion
• Size-change termination and satisfiability for linear-time temporal logics
• Functional specification of hardware via temporal logic
• Regular Linear Temporal Logic
• Specification languages for stutter-invariant regular properties
• Deciding the unguarded modal \(\mu\)-calculus
• Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations
• Expressive completeness of separation logic with two variables and no separating conjunction
• Formal Methods in Computer-Aided Design
• On regular temporal logics with past

This page was built for publication: Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness

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