Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.
Disjunctive Transition Relation Decomposition for Efficient Reachability Analysis
By: Stergiou, S.; Jain, J.;
2006 / IEEE / 1-4244-0679-X
Description
This item was taken from the IEEE Conference ' Disjunctive Transition Relation Decomposition for Efficient Reachability Analysis ' The applicability of disjunctive Transition Relation decompositions in the context of symbolic model checking is researched. An algorithm that generates such decompositions is proposed and evaluated on the VIS benchmarks. The obtained decompositions are well-balanced and the algorithm compares well with IWLS'95.
Related Topics
Vis Benchmark
Disjunctive Transition Relation Decomposition
Reachability Analysis
Symbolic Model Checking
Boolean Functions
Data Structures
Binary Decision Diagrams
Circuit Simulation
Context Modeling
Computational Modeling
Latches
Testing
Conferences
Formal Verification
Reachability Analysis
Engineering
Reachability Analysis
