Gossiping Girls Are All Alike [chapter]

Theo C. Ruys, Pim Kars
2012 Lecture Notes in Computer Science  
This paper discusses several different ways to model the wellknown gossiping girls problem in promela. The highly symmetric nature of the problem is exploited using plain promela, topspin (an extension to Spin for symmetry reduction), and by connecting Spin to bliss (a tool to compute canonical representations of graphs). The model checker Spin is used to compare the consequences of the various modelling choices. This -tutorial style -paper is meant as a road map of the various ways of modelling symmetric systems that can be explored.
doi:10.1007/978-3-642-31759-0_10 fatcat:gnfn224zhzh5bopt4b6eqj2yii