Facta universitatis - series: Electronics and Energetics 2011 Volume 24, Issue 3, Pages: 325-339
https://doi.org/10.2298/FUEE1103325P
Full text (
100 KB)
Linear algorithms for recognizing and parsing superpositional graphs
Peder Ahti (University of Tartu, Tartu, Estonia)
Nestra Härmel (University of Tartu, Tartu, Estonia)
Raik Jaan (Tallinn University of Technology, Tallinn, Estonia)
Tombak Mati (Tallinn University of Technology, Tallinn, Estonia)
Ubar Raimund (Tallinn University of Technology, Tallinn, Estonia)
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.
Keywords: BDD, binary graph, structurally synthesized binary decision diagram(SSBDD), recognition algorithm