Polynomial approximations for model checking

DOI10.1007/B94823MaRDI QIDQ5902425zbMATH OpenOpenAlexFDO

Authors Nikolay V. Shilov, Natalya O. Garanina

Publication date 5 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b94823

zbMATH Keywords

complexitymodel checking\(\mu \)-calculus

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1432245
• On model checking for the \(\mu\)-calculus and its fragments
• On the universal and existential fragments of the \(\mu\)-calculus
• Model checking and boolean graphs
• scientific article; zbMATH DE number 1956572

Cited in

(4)

• Model checking in the modal \(\mu \)-calculus and generic solutions
• Algorithmic algebraic model checking. III: Approximate methods
• Verification, Model Checking, and Abstract Interpretation
• Self-correcting polynomial programs

This page was built for publication: Polynomial approximations for model checking

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