2873 search results - page 393 / 575 » Model Checking and the Mu-calculus |
LICS
2006
IEEE
14 years 2 months 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....
DNA
2005
Springer
14 years 1 months 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...
TACAS
2005
Springer
14 years 1 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...
PASTE
2004
ACM
14 years 1 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...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...