An Asymptotically Correct Finite Path Semantics for LTL

DOI10.1007/978-3-642-28717-6_24MaRDI QIDQ2891462zbMATH OpenOpenAlexFDO

Authors Andreas Morgenstern, Manuel Gesell, Klaus Schneider

Publication date 15 June 2012

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• LTL on finite and process traces: complexity results and a practical reasoner
• scientific article; zbMATH DE number 1954378
• An automata-theoretic approach to constraint LTL
• scientific article; zbMATH DE number 1948409
• \(\mathrm{LTL}_{f}\) satisfiability checking
• LTL model checking for recursive programs
• Infinite-state model checking of LTLR formulas using narrowing
• An explicit transition system construction approach to LTL satisfiability checking

Cited in

(2)

• Comparing LTL semantics for runtime verification
• Synthesizing adaptive test strategies from temporal logic specifications

This page was built for publication: An Asymptotically Correct Finite Path Semantics for LTL

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