An n log n algorithm for online BDD refinement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1254, Issue , 1997, Pages 107-118

  Klarlund, Nils ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; COMPUTER AIDED ANALYSIS;

CANONICAL REPRESENTATIONS; FINITE FUNCTIONS; FINITE SET; FIXED POINTS; MULTI-VALUED; PATH COMPRESSION; TRANSITION FUNCTIONS; VERIFICATION SYSTEMS;

BOOLEAN FUNCTIONS;

EID: 84947420313     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63166-6_13     Document Type: Conference Paper

References (12)

1. D. Basin and N. Klarlund. Beyond the finite in hardware verification. Submitted. Extended version of: "Hardware verification using monadic second-order logic," CAV '95, LNCS 939, 1996.
2. Norbert Blum. An o(n log n) implementation of the standard mothod for minimizing n-state finite automata. Information Processing Letters, 1996.
3. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing surveys, 24(3):293-318, September 1992.
4. A. Cardon and M. Crochemore. Partitioning a graph in O(IA) log 2(VI). TCS, 19:85-98, 1982.
5. Aarti Gupta. Inductive Boolean function manipulation. PhD thesis, Carnegie Mellon University, 1994. CMU-CS-94-208.
6. Aarti Gupta and Allan L. Fisher. Representation and symbolic manipulation of linearly inductive boolean functions. In Proceedings of the IEEE International Conference on Computer-Aided Design, pages 192-199. IEEE Computer Society Press, 1993.
7. J.G. Henriksen, J. Jensen, M. JCrgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Tools and Algorithms for the Construction and Analysis of Systems, First International Workshop, TACAS '95, LNCS 1019, 1996. Also available through http://www.brics.dk/~klarlund/MonaFido/papers.html.
8. J. Hopcroft. An n log n algorithm for minimizing states in a finite automaton. In Z. Kohavi and Paz A., editors, Theory of machines and computations, pages 189-196. Academic Press, 1971.
9. D. Lee and M. Yannakakis. Online minimization of transition systems. In Proc. STOC, pages 264-274. ACM, 1992.
10. H-T. Liaw and C-S. Lin. On the OBDD-representation of general Boolean functions. IEEE Trans. on Computers, C-41(6):661-664, 1992.
11. R. Paige and R. Tarjan. Three efficient algorithms based on partition refinement. SIAM Yournal of Computing, 16(6), 1987.
12. D. Sieling and I. Wegener. Reduction of OBDDs in linear time. IPL, 48:139-144, 1993.