Proceedings of 1993 IEEE International Conference on Computer Design ICCD'93
DOI: 10.1109/iccd.1993.393362
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 13 publications
0
3
0
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%
See 1 more Smart Citation
“…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%
“…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%