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...
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...
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...
Taolue Chen, Marta Z. Kwiatkowska, David Parker, A...
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
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...
Paolo Ballarini, Michael Fisher, Michael Wooldridg...