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

DOI10.1007/978-3-540-74407-8_7zbMath1151.68540OpenAlexW1545924555MaRDI QIDQ3525631

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

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

Related Items (8)

Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction ⋮ Size-Change Termination and Satisfiability for Linear-Time Temporal Logics ⋮ Functional Specification of Hardware via Temporal Logic ⋮ Deciding the unguarded modal -calculus ⋮ Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations ⋮ On regular temporal logics with past ⋮ Temporal logic with recursion ⋮ Specification Languages for Stutter-Invariant Regular Properties

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