Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

CAV
1993
Springer

favoriteEmaildiscussreport

127views Hardware» more CAV 1993»

Symbolic Equivalence Checking

14 years 3 months ago

Symbolic Equivalence Checking

Download ftp.inrialpes.fr

Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality is relative to an equivalence relation. The method relies on a symbolic representation of the state space. We compute the minimal labeled transition system using the Binary Decision Diagram structures to represent the set of equivalence classes. Some experiments are presented, using a model obtained from LOTOS speciﬁcations.

Jean-Claude Fernandez, Alain Kerbrat, Laurent Moun

Real-time Traffic

CAV 1993 | Equivalence Relation | Hardware | Labeled Transition System | Minimal Labeled Transition |

claim paper

Related Content

» Checking Equivalence for Reo Networks

» Error Diagnosis in Equivalence Checking of High Performance Microprocessors

» Symbolic Equivalences for Open Systems

» Using model checking with symbolic execution to verify parallel numerical programs

» Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking

» MCSOG An LTL Model Checker Based on Symbolic Observation Graphs

» Symbolic pruning of concurrent program executions

» A Trace Based Bisimulation for the Spi Calculus An Extended Abstract

» Model Checking Verilog Descriptions of Cell Libraries

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1993
Where	CAV
Authors	Jean-Claude Fernandez, Alain Kerbrat, Laurent Mounier

Comments (0)