Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines

Authors:
Christoph Meinel;Thorsten Theobald
Affiliations:
FB IV–Informatik, Universität Trier, D–54286, Trier, Germany;Zentrum Mathematik, TU München, D–80290, München, Germany
Venue:
Formal Methods in System Design
Year:
2001

Citing 10
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Sequential logic testing and verification

Sequential logic testing and verification
On the OBDD-Representation of General Boolean Functions

IEEE Transactions on Computers
BDD variable ordering for interacting finite state machines

DAC '94 Proceedings of the 31st annual Design Automation Conference
Efficient OBDD-based boolean manipulation in CAD beyond current limits

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Who are the variables in your neighborhood

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Linear sifting of decision diagrams

DAC '97 Proceedings of the 34th annual Design Automation Conference
Algorithms and Data Structures in VLSI Design

Algorithms and Data Structures in VLSI Design
On the Influence of the State Encoding on OBDD-Representations of Finite State Machines

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science

An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Ackermann encoding, bisimulations and OBDDs

Theory and Practice of Logic Programming
Transformation of a mealy finite-state machine into a moore finite-state machine by splitting internal states

Journal of Computer and Systems Sciences International
A method for minimizing Moore finite-state machines by merging two states

Journal of Computer and Systems Sciences International

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ordered binary decision diagrams are the state-of-the-art representation of switching functions. In order to keep the sizes of OBDDs tractable, heuristics and dynamic reordering algorithms are applied to optimize the underlying variable order. When finite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze local encoding transformations which can be applied dynamically. First, we investigate the potential of re-encoding techniques. We then propose the use of an XOR-transformation and show why this transformation is most suitable among the set of all encoding transformations. The presented theoretical framework establishes a new optimization technique for OBDDs.