138 search results - page 11 / 28 » Model Checking Round-Based Distributed Algorithms |
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Service matchmaking is the process of finding suitable services given by the providers for the service requests of consumers. Previous approaches to service matchmaking is mostly ...
CMSB
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
STTT
2010
14 years 7 months ago
2010
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
MICAI
2005
Springer
15 years 2 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 ...
75
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...