Computing the observable equivalence relation of a finite state machine

Authors:
Thomas Tamisier
Affiliations:
Bull Research Coordination, Rue Jean Jaurès, F-78340 Les Clayes-Sous-Bois, France
Venue:
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Year:
1993

Citing 3
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
Auto/Autograph

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification

Computing subsets of equivalence classes for large FSMs

EURO-DAC '95/EURO-VHDL '95 Proceedings of the conference on European design automation
Verification of Similar FSMs by Mixing Incremental Re-encoding, Reachability Analysis, and Combinational Checks

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract