4962 search results - page 709 / 993 » Stochastic Model Checking |
121
click to vote
DNA
2005
Springer
15 years 7 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...
129
click to vote
TACAS
2005
Springer
15 years 7 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...
112
Voted
PASTE
2004
ACM
15 years 7 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...
117
click to vote
FSTTCS
2004
Springer
15 years 7 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...
TACAS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...