Building efficient model checkers using hierarchical set decision diagrams and automatic saturation

DOI10.3233/FI-2009-137MaRDI QIDQ3647367zbMATH OpenOpenAlexFDO

Authors Alexandre Hamez, Yann Thierry-Mieg, Fabrice Kordon

Publication date 30 November 2009

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-137

zbMATH Keywords

hierarchical decision diagramsmodel checkingsaturation

Mathematics Subject Classification ID

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

Recommendations

• Hierarchical Set Decision Diagrams and Automatic Saturation
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Hierarchical Set Decision Diagrams and Regular Models
• Symbolic model checking with sentential decision diagrams
• Symbolic model checking: \(10^{20}\) states and beyond

Cited in

(7)

• Nested-unit Petri nets
• Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
• Hierarchical Set Decision Diagrams and Automatic Saturation
• Hierarchical Set Decision Diagrams and Regular Models
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• A decision diagram operation for reachability
• Improving Saturation Efficiency with Implicit Relations

Describes a project that uses

Uses Software

• libDDD
• Renew

This page was built for publication: Building efficient model checkers using hierarchical set decision diagrams and automatic saturation

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