151 search results - page 16 / 31 » P-Semiflow Computation with Decision Diagrams |
COMPSAC
2003
IEEE
14 years 25 days ago
2003
IEEE
In this paper, we propose an algorithm to construct the Ordered Binary Decision Diagram (OBDD) representing the cut function of a terminal-pair network. The algorithm recognizes i...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
CAV
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...