On Complexity of Internal and External Equivalence Checking

13 years 8 months ago

Download eigold.tripod.com

We compare the complexity of "internal" and "external" equivalence checking. The former is meant for proving the correctness of a synthesis transformation by which circuit N2 is obtained from

Eugene Goldberg, Kanupriya Gulati

Real-time Traffic

DSD 2007 | Equivalence Checking | Hardware | Synthesis Transformation |

claim paper

» On the complexity of checking semantic equivalences between pushdown processes and finites...

» Changing Programs Correctly Refactoring with Specifications

» Towards Equivalence Checking Between TLM and RTL Models

» Bisimulator 20 An OntheFly Equivalence Checker based on Boolean Equation Systems

» A Global Timed Bisimulation Preserving Abstraction for Parametric TimeInterval Automata

» Retaining the Probabilities in Probabilistic Testing Theory

» Planning and Monitoring Web Service Composition

» Representational Content and the Reciprocal Interplay of Agent and Environment

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	DSD
Authors	Eugene Goldberg, Kanupriya Gulati

Comments (0)

Sciweavers

On Complexity of Internal and External Equivalence Checking

DSD 2007 | Equivalence Checking | Hardware | Synthesis Transformation |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers