Sciweavers

646 search results - page 86 / 130
» Hybrid decision diagrams
Sort
View
DIS
2006
Springer
14 years 15 days ago
Symmetric Item Set Mining Based on Zero-Suppressed BDDs
In this paper, we propose a method for discovering hidden information from large-scale item set data based on the symmetry of items. Symmetry is a fundamental concept in the theory...
Shin-ichi Minato
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
14 years 15 days ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
APN
2000
Springer
14 years 14 days ago
Efficient Symbolic State-Space Construction for Asynchronous Systems
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
Gianfranco Ciardo, Gerald Lüttgen, Radu Simin...
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
14 years 13 days ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...
ISSTA
1998
ACM
14 years 13 days ago
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
William Chan, Richard J. Anderson, Paul Beame, Dav...