317 search results - page 34 / 64 » Bounded Model Checking with QBF |
160
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
140
click to vote
ACSD
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
128
click to vote
ICALP
1994
Springer
15 years 9 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
147
click to vote
MICAI
2005
Springer
15 years 10 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
130
click to vote
QEST
2006
IEEE
15 years 11 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...