198 search results - page 34 / 40 » Reachability on prefix-recognizable graphs |
COCOON
2001
Springer
14 years 2 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
TABLEAUX
1998
Springer
14 years 2 months ago
1998
Springer
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...
CONEXT
2007
ACM
14 years 1 months ago
2007
ACM
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
ATVA
2004
Springer
14 years 1 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
AAAI
2007
14 years 6 days ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...