A new heuristic for bad cycle detection using BDDs

DOI10.1023/A:1008727508722MaRDI QIDQ5943260zbMATH OpenOpenAlexFDO

Authors R. H. Hardin, R. P. Kurshan, Moshe Y. Vardi, S. K. Shukla

Publication date 9 September 2001

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008727508722

zbMATH Keywords

bad cyclescycle-detection

Mathematics Subject Classification ID

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

Recommendations

• Is there a best symbolic cycle-detection algorithm?
• Error detection with directed symbolic model checking
• Bounded model checking using satisfiability solving
• scientific article; zbMATH DE number 1863167
• scientific article; zbMATH DE number 2102721

Cited in

(11)

• Model checking with fairness assumptions using PAT
• An approach to the verification of symmetric parameterized distributed systems
• An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
• Model checking with strong fairness
• From complementation to certification
• Is there a best symbolic cycle-detection algorithm?
• scientific article; zbMATH DE number 1324661 (Why is no real title available?)
• Linear temporal logic symbolic model checking
• scientific article; zbMATH DE number 2102721 (Why is no real title available?)
• Automata-Theoretic Model Checking Revisited
• A truly symbolic linear-time algorithm for SCC decomposition

This page was built for publication: A new heuristic for bad cycle detection using BDDs

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