The General Product Machine: a New Model for Symbolic FSM Traversal

Authors:
Giampiero Cabodi;Paolo Camurati;Fulvio Corno;Paolo Prinetto;Matteo Sonza Reorda
Affiliations:
Politecnico di Torino, Dipartimento di Automatica e Informatica, Torino, Italy;Politecnico di Torino, Dipartimento di Automatica e Informatica, Torino, Italy;Politecnico di Torino, Dipartimento di Automatica e Informatica, Torino, Italy;Politecnico di Torino, Dipartimento di Automatica e Informatica, Torino, Italy;Politecnico di Torino, Dipartimento di Automatica e Informatica, Torino, Italy
Venue:
Formal Methods in System Design
Year:
1998

Citing 8
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Verification of synchronous sequential machines based on symbolic execution

Proceedings of the international workshop on Automatic verification methods for finite state systems
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
The FSM network model for behavioral synthesis of control-dominated machines

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Representing circuits more efficiently in symbolic model checking

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A new model for improving symbolic product machine traversal

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Algorithms for approximate FSM traversal

DAC '93 Proceedings of the 30th international Design Automation Conference
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series

Verification of Similar FSMs by Mixing Incremental Re-encoding, Reachability Analysis, and Combinational Checks

Formal Methods in System Design
Confirming Configurations in EFSM Testing

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proving the equivalence of two Finite State Machines (FSMs) has manyapplications to synthesis, verification, testing, and diagnosis. Buildingtheir product machine is a theoretical framework for equivalence proof.There are some cases where product machine traversal, a necessary andsufficient check, is mandatory. This is much more complex than traversingjust one of the component machines. This paper proposes anequivalence-preserving function that transforms the product machine in theGeneral Product Machine (GPM). Using the GPM insymbolic state space traversal reduces the size of the BDDs and makes imagecomputation easier. As a result, GPM traversal is much less expensive thanproduct machine traversal, its cost being close to dealing with a singlemachine.