Sciweavers

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

13

DAC
1996
ACM

favoriteEmaildiscussreport

78views Computer Architecture» more DAC 1996»

State Reduction Using Reversible Rules

13 years 8 months ago

State Reduction Using Reversible Rules

Download www.cs.york.ac.uk

We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the method is to identify state generation rules that can be inverted. It can be used for verification of deadlock-freedom, error and invariant checking and stuttering-invariant CTL model checking.

C. Norris Ip, David L. Dill

Real-time Traffic

Automatic Verification | Computer Architecture | DAC 1996 | State Explosion Problem | State Generation Rules |

claim paper

Related Content

» Making revision reversible an approach based on polynomials

» Runtime Active Leakage Reduction by power gating and reverse body biasing An eNERGY vIEW

» State Space Reduction of Rewrite Theories Using Invisible Transitions

» Coverage Preserving Reduction Strategies for Reachability Analysis

» Reduction rules for resetinhibitor nets

» Realization of Digital Fuzzy Operations Using MultiValued Fredkin Gates

» An analysis of rule coverage as a criterion in generating minimal test suites for grammarb...

» Generalized Lr Parsing Algorithm for Boolean Grammars

» Decidable and Undecidable SecondOrder Unification Problems

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1996
Where	DAC
Authors	C. Norris Ip, David L. Dill

Comments (0)