3224 search results - page 465 / 645 » On Checking Model Checkers |
160
click to vote
ACSD
2006
IEEE
16 years 16 days ago
2006
IEEE
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
180
click to vote
LICS
2006
IEEE
16 years 14 days ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
171
click to vote
DNA
2005
Springer
16 years 5 hour ago
2005
Springer
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...
183
click to vote
TACAS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
157
click to vote
PASTE
2004
ACM
15 years 12 months ago
2004
ACM
Model checking requires a specification of the target system’s desirable properties, some of which are temporal. Formulating a property of the system based on either its abstrac...