Constructive finite trace analysis with linear temporal logic

DOI10.1007/978-3-642-30473-6_11MaRDI QIDQ2900185zbMATH OpenOpenAlexFDO

Authors Martin Sulzmann, Axel Zechner

Publication date 20 July 2012

Published in Tests and Proofs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30473-6_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• Finite-trace linear temporal logic: coinductive completeness
• scientific article; zbMATH DE number 2080059
• \(\mathrm{LTL}_{f}\) satisfiability checking
• LTL on finite and process traces: complexity results and a practical reasoner
• The tractability of model-checking for LTL: the good, the bad, and the ugly fragments

Cited in

(8)

• Checking finite traces using alternating automata
• scientific article; zbMATH DE number 2080059 (Why is no real title available?)
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Model Checking Software
• Finite-trace linear temporal logic: coinductive completeness
• Static analysis for state-space reductions preserving temporal logics
• Explainable online monitoring of metric temporal logic
• scientific article; zbMATH DE number 6174011 (Why is no real title available?)

This page was built for publication: Constructive finite trace analysis with linear temporal logic

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