Sciweavers

2584 search results - page 68 / 517
» On the Forward Checking Algorithm
Sort
View
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
14 years 8 days ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
14 years 2 months ago
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
Yang Zhao, Gianfranco Ciardo
ENTCS
2008
87views more  ENTCS 2008»
13 years 8 months ago
Checking Emptiness of Non-Deterministic Regular Types with Set Operators
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterized type definitions is presented. The algorithm generalizes previous...
Lunjin Lu
LMCS
2006
87views more  LMCS 2006»
13 years 8 months ago
Model Checking Probabilistic Pushdown Automata
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
Antonín Kucera, Javier Esparza, Richard May...
ICST
2010
IEEE
13 years 6 months ago
Timed Moore Automata: Test Data Generation and Model Checking
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
Helge Löding, Jan Peleska