10870 search results - page 134 / 2174 » Model Checking Programs |
114
click to vote
SAT
2004
Springer
15 years 7 months ago
2004
Springer
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
119
click to vote
COCOON
2003
Springer
15 years 6 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
DSN
2005
IEEE
15 years 7 months ago
2005
IEEE
CAV
2004
Springer
15 years 7 months ago
2004
Springer