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

DOI10.3233/FI-2009-137zbMATH Open1183.68374OpenAlexW1823120935MaRDI QIDQ3647367FDOQ3647367

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

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

zbMATH Keywords

model checkingsaturationhierarchical decision diagrams

Mathematics Subject Classification ID

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

Cited In (7)

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

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)