On the distributivity of LTL specifications

DOI10.1145/1740582.1740588MaRDI QIDQ2946608zbMATH OpenOpenAlexFDO

Authors Marko Samer, Helmut Veith

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1740582.1740588

zbMATH Keywords

constraint satisfactiondistributivityLTLquery solvingstrongest solutionsyntactic characterizationtemplate characterizationunique solution

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automata, Languages and Programming
• Computer Science Logic
• Variants of LTL query checking
• SOFSEM 2005: Theory and Practice of Computer Science
• Temporal normal form for linear temporal logic formulae

Cited in

(1)

• Automata, Languages and Programming

This page was built for publication: On the distributivity of LTL specifications

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