BDD vs. constraint-based model checking: An experiment evaluation for asynchronous concurrent systems

DOI10.1007/3-540-46419-0_30MaRDI QIDQ2729083zbMATH OpenFDO

Authors Tevfik Bultan

Publication date 6 November 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46419-0_30

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computing methodologies and applications (68U99)

Recommendations

• Computer Aided Verification
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 2111990
• Verification of asynchronous circuits by BDD-based model checking of Petri nets
• Exploiting step semantics for efficient bounded model checking of asynchronous systems
• Bounded model checking for asynchronous hyperproperties
• Symbolic CTL model checking of asynchronous systems using constrained saturation
• scientific article; zbMATH DE number 1903352

Cited in

(8)

• Program specialization for verifying infinite state systems: an experimental evaluation
• scientific article; zbMATH DE number 1979553 (Why is no real title available?)
• scientific article; zbMATH DE number 1786639 (Why is no real title available?)
• scientific article; zbMATH DE number 2102716 (Why is no real title available?)
• scientific article; zbMATH DE number 2111983 (Why is no real title available?)
• Improving BDD based symbolic model checking with isomorphism exploiting transition relations
• Computer Aided Verification
• Automata, Languages and Programming

This page was built for publication: BDD vs. constraint-based model checking: An experiment evaluation for asynchronous concurrent systems

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