7 search results - page 2 / 2 » Answer Set Programming and Bounded Model Checking |
99
Voted
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
112
Voted
CONCUR
2001
Springer
15 years 5 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...