Efficient analysis of cyclic definitions

DOI10.1007/3-540-48683-6_34MaRDI QIDQ4818807zbMATH OpenFDO

Authors Kedar S. Namjoshi, R. P. Kurshan

Publication date 24 September 2004

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

Full work available at URL https://doi.org/10.1007/3-540-48683-6_34

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Analysis of cyclic combinational circuits
• A new heuristic for bad cycle detection using BDDs
• Is there a best symbolic cycle-detection algorithm?
• scientific article; zbMATH DE number 4153916
• Automatic Verification of Sequential Circuits Using Temporal Logic

Cited in

(3)

• Analysis of cyclic combinational circuits
• Constructive Boolean circuits and the exactness of timed ternary simulation
• A new heuristic for bad cycle detection using BDDs

This page was built for publication: Efficient analysis of cyclic definitions

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