554 search results - page 8 / 111 » Approximate Probabilistic Model Checking |
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
Probabilistic model checking is a formal verification framework for systems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, includ...
102
click to vote
ASIAN
2003
Springer
15 years 2 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
145
click to vote
CLIMA
2011
13 years 9 months ago
2011
Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of effi...
104
click to vote
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
ENTCS
2006
14 years 9 months ago
2006
It has been recognised for some time that there are close links between the various logics developed for the analysis of multi-agent systems and the many game-theoretic models dev...