6608 search results - page 255 / 1322 » On the Completeness of Model Checking |
159
click to vote
TOPNOC
2008
15 years 5 months ago
2008
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
180
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
135
click to vote
CSB
2004
IEEE
15 years 9 months ago
2004
IEEE
Shannon information in the genomes of all completely sequenced prokaryotes and eukaryotes are measured in word lengths of two to ten letters. It is found that in a scale-dependent...
141
click to vote
DBPL
2007
Springer
16 years 3 days ago
2007
Springer
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...
166
click to vote
LPAR
2007
Springer
16 years 2 days ago
2007
Springer
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...