{'fraction_non_alphanumeric': 0.01732283464566929, 'fraction_numerical': 0.0, 'mean_word_length': 5.36, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Case Study: Verification of a Leader Election Protocol using Augur

We consider a case study of a leader election protocol and verify it using the tool Augur, which is based on unfolding techniques for graph transformation systems. We first investigate a finite-state variant of the leader election protocol and show how to verify it using McMillanstyle unfoldings, avoiding an exponential explosion of the state space. Then, in a next step, we consider a parametric version based on attributed graph transformation. This variant is verified via approximated unfoldings in combination with counterexample-guided abstraction refinement.