Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs | Zendy

Christoph Meinel | Zendy; Harald Sack | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Probabilistic Symbolic Simulation and Verification with ⊕-OBDDs

Author(s) -

Christoph Meinel,

Harald Sack

Publication year - 1999

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/s1571-0661(05)80601-2

Subject(s) - binary decision diagram , probabilistic logic , computer science , combinational logic , formal verification , algorithm , theoretical computer science , logic gate , artificial intelligence

Ordered Binary Decision Diagrams (OBDDs) have already proved useful in the verification of combinational and sequential circuits. Due to limitations of the descriptive power of OBDDs several more general models of Binary Decision Diagrams have been studied. In this paper, ⊕-OBDDs - also known as Mod2OBDDs - in respect to their ability to serve as a tool for combinational verification are considered. Besides the application of ⊕-OBDDs, the more general problem of how to exploit the inherent potential of ⊕-OBDDs more efficiently is addressed

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research