Abstract
Structurally synthesized binary decision diagrams (SSBDD) are a special type of BDDs that are generated by superposition according to the structure of propositional formula. Fast algorithms for simulation, diagnostic reasoning and test generation running on SSBDDs exploit their specific properties. Hence the correctness of SSBDDs should be checked before using those algorithms. The problem of recognizing SSBDDs can be reduced to the problem of recognizing their skeleton, namely superpositional graphs, which are a proper subclass of binary graphs. This paper presents linear time algorithms for testing whether a binary graph is a superpositional graph and for restoring the history of its generating process.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Facta universitatis - series: Electronics and Energetics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
