Abstract
Verifying whether rational participants in a BAR system (a distributed system including Byzantine, Altruistic and Rational participants) would deviate from the specified behaviour is important but challenging. Existing works consider this as Nash-equilibrium verification in a multi-player game. There is no automatic verification algorithm to address it in probabilistic settings. In this work, we introduce PBAR system and propose model checking algorithms to verify Nash-equilibrium. We perform case studies to validate the algorithms.