30 search results - page 4 / 6 » Increasing the Robustness of Bounded Model Checking by Compu... |
ACSD
2008
IEEE
13 years 7 months ago
2008
IEEE
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
PUK
2000
13 years 6 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
IFM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
ICECCS
2010
IEEE
13 years 5 months ago
2010
IEEE
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
LICS
2009
IEEE
13 years 12 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...