244 search results - page 22 / 49 » Counterexamples in Probabilistic Model Checking |
189
click to vote
CLIMA
2011
14 years 2 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...
148
click to vote
ATVA
2006
Springer
15 years 6 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...
128
click to vote
ENTCS
2006
15 years 2 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...
130
click to vote
QEST
2010
IEEE
15 years 7 days ago
2010
IEEE
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
155
Voted
LICS
2002
IEEE
15 years 7 months ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...