Abstract
Proving the equivalence of two Finite State Machines (FSMs) has many applications to synthesis, verification, testing, and diagnosis. Building their product machine is a theoretical framework for equivalence proof. There are some cases where product machine traversal, a necessary and sufficient check, is mandatory. This is much more complex than traversing just one of the component machines. This paper proposes an equivalence-preserving function that transforms the product machine in theGeneral Product Machine (GPM). Using the GPM in symbolic state space traversal reduces the size of the BDDs and makes image computation easier. As a result, GPM traversal is much less expensive than product machine traversal, its cost being close to dealing with a single machine.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.S. Brace, R.L. Rudell and R.E. Bryant, “Efficient Implementation of a BDD Package,” 27th ACM/IEEE Design Automation Conference, Orlando, Florida, pp. 40–45, June 1990.
F. Brglez, D. Bryan and K. Koźmiński, “Combinatorial Profiles of Sequential Benchmark Circuits,” IEEE Int'l Symposium on Circuits and Systems, Portland, Oregon, pp. 1929–1934, May 1989.
R.E. Bryant, “Graph-based Algorithms for Boolean Function Manipulation,” IEEE Transactions on Computers, Vol. C-35, pp. 677–691, August 1986.
J.R. Burch, E.M. Clarke and D.E. Long, “Representing Circuits More Efficiently in Symbolic Model Checking,” 28th ACM/IEEE Design Automation Conference, San Francisco, California, pp. 403–407, June 1991.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill and L.J. Hwang, “Symbolic Model Checking: 1020 States and Beyond,” 5th Annual IEEE Symposium on Logic in Computer Science, pp. 428–439, June 1990.
G. Cabodi and P. Camurati, “Exploiting cofactoring for efficient FSM symbolic traversal based on the Transition Relation,” IEEE Int'l Conference on Computer Design, Cambridge, Massachusetts, pp. 299–303, October 1993.
G. Cabodi, P. Camurati, F. Corno, S. Gai, P. Prinetto and M. Sonza Reorda, “A new model for improving symbolic Product Machine traversal,” 29thACM/IEEE Design Automation Conference, Anaheim, California, pp. 614–619, June 1992.
G. Cabodi, P. Camurati, F. Corno, P. Prinetto and M. Sonza Reorda, “An Approach to Sequential Circuit Diagnosis based on Formal Verification Techniques” Journal of Electronic Testing: Theory and Applications, Vol. 4, pp. 11–17, February 1993.
G. Cabodi, P. Camurati and S. Quer, “Detecting hard faults with combined approximate forward / backward symbolic techniques,” IEEE Int'l Symposium on Circuits and Systems, London, UK, May 1994.
H. Cho, G.D. Hachtel, E. Macii, B. Plessier and F. Somenzi, “Algorithms for approximate FSM traversals,” 30th ACM/IEEE Design Automation Conference, Dallas, Texas, pp. 25–30, June 1993.
H. Cho, G.D. Hachtel and F. Somenzi, “Redundancy identification/removal and test generation for sequential circuits using implicit state enumeration,” IEEE Transactions on CAD, Vol. 12, pp. 935–945, July 1993.
H. Cho, S.-W. Jeong, F. Somenzi and C. Pixley, “Synchronization Sequences and Symbolic Traversal Techniques in Test Generation” Journal of Electronic Testing: Theory and Applications, Vol. 4, pp. 19–31, February 1993.
H. Cho, G. Hachtel, S.W. Jeong, B. Plessier, E. Schwarz and F. Somenzi, “ATPG Aspects of FSM Verification,” IEEE Int'l Conference on Computer Aided Design, Santa Clara, California, pp. 134–137, November 1990.
H. Cho, G. Hachtel, S.W. Jeong, B. Plessier, E. Schwarz and F. Somenzi, “Results on the Interface Between Formal Verification and ATPG,” in E.M. Clarke and R. Kurshan, Eds., DIMACS Series in Discrete Mathematics Science, Volume 3, pp. 615–628, 1991.
O. Coudert, C. Berthet and J.C. Madre, “Verification of sequential machines based on symbolic execution,” in Automatic verification methods for finite state systems, volume 407 of LNCS, Springer-Verlag, Berlin, Germany, pp. 365–373, 1989.
O. Coudert, C. Berthet and J.C. Madre, “Verification of Sequential Machines Using Boolean Function Vectors,” IFIP Int'l Workshop on Applied Formal Methods for Correct VLSI Design, Vol. 1, Leuven, Belgium, pp. 111–128, November 1989.
O. Coudert and J.C. Madre, “A Unified Framework for the Formal Verification of Sequential Circuits,” IEEE Int'l Conf. on Computer Aided Design, Santa Clara, California, pp. 126–129, November 1990.
O. Coudert and J.C. Madre, “Symbolic Computation of the Valid States of the Sequential Machine: Algorithms and Discussion,” Int'l Workshop on Formal Methods in VLSI Design, Miami, Florida, January 1991.
P. Goel, “An Implicit Enumeration Algorithm to Generate Tests for Combinatorial Logic Circuits,” IEEE Transactions on Computers, Vol. C-30, pp. 215–222, 1981.
S.H. Hwang and A.R. Newton, “An Efficient Verifier for Finite State Machines,” IEEE Transactions on CAD, Vol. 10, pp. 326–334, March 1991.
Z. Kohavi, Switching and Finite Automata Theory, second edition, Computer Science Series, McGraw Hill, New York, 1978.
C. Leiserson and J. Saxe, “Retiming Synchronous Circuitry,” Algorithmica, Vol. 6, pp. 5–35, 1991.
H. Touati, H. Savoj, B. Lin, R.K. Brayton and A. Sangiovanni-Vincentelli, “Implicit Enumeration of Finite State Machines Using BDDs,” IEEE Int'l Conference on Computer Aided Design, Santa Clara, California, pp. 130–133, November 1990.
W. Wolf, “The FSM network model for behavioral synthesis of control-dominated machines,” 27th IEEE/ACM Design Automation Conference, Orlando, Florida, pp. 692–697, June 1990.
Rights and permissions
About this article
Cite this article
Cabodi, G., Camurati, P., Corno, F. et al. The General Product Machine: a New Model for Symbolic FSM Traversal. Formal Methods in System Design 12, 267–289 (1998). https://doi.org/10.1023/A:1008632417306
Issue Date:
DOI: https://doi.org/10.1023/A:1008632417306