Exploiting cofactoring for efficient FSM symbolic traversal based on the transition relation

Cabodi, Gianpiero; Camurati, P.

doi:10.1109/iccd.1993.393362

Cited by 12 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The relation contains the couples (current state ii -next state y) such that there is at least an input value z that brings the FSM from state s to state y. Riecent results make the transition relation again comipetitive with approaches based on the "trunsztzon functzon" [lo], by exploiting the "em%' cofactor [5]. Writ tng hereinafter, with abuse of notation, the function's name for its characteristic function, the transition relat lion is: (1)…”

Section: Boolean Function Representatian Asmentioning

confidence: 99%

“…Starting from the limits of standard forward [lo], [5] and backward traversals [22], [20], [15], [21], [MI, [14], this paper presents a mixed approximate forward and exact backward traversal procedure for test pattern generation. A fast and cheap approximate forward traversal computes on a step-by-step basis overestimations of the reachable state space.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Full symbolic ATPG for large circuits

Cabodi

Camurati

Quer

Proceedings., International Test Conference

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Boolean Function Representatian Asmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Full symbolic ATPG for large circuits

Cabodi

Camurati

Quer

Proceedings., International Test Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…B They use sophisticated symbolic algorithms based on BDDs for efficient state-set and transition relation representation and manipulation (e.g., [6]). …”

Section: Introductionmentioning

confidence: 99%

Enhancing FSM traversal by temporary re-encoding

Cabodi

Camurati²,

Lavagao³

et al.

Proceedings International Conference on Computer Design. VLSI in Computers and Processors

Self Cite

View full text Add to dashboard Cite

Synthesis and optimization of large finite-state machines has improved dramatically over the last f e w years with the introduction and rapid improvement of symbolic-state manipulation techniques. T h e algorithms efficiently visit each reachable state in the machine while computing and storing information about these states. We propose a new technique f o r imp-roving the efficacy of traversal algorithms: re-encoding the states of the machine to moTe efficiently represent state sets o r state transitions, or t o more efficiently compute the next set of states. OUT technique can be e m b e d d e d in existing traversal algorithms. Experiments reveal that re-encoding can i n d e e d reduce the time and/or space reqzired f o r traversal.

show abstract