12981 search results - page 583 / 2597 » Model Checking (Abstract) |
185
click to vote
ACSD
2006
IEEE
16 years 1 months 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...
204
click to vote
LICS
2006
IEEE
16 years 1 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....
190
click to vote
DNA
2005
Springer
16 years 19 days 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
FSTTCS
2004
Springer
16 years 14 days 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...
194
click to vote
LICS
2003
IEEE
16 years 11 days ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...