The paper presents a method can be used to verify properties of asynchronous distributed algorithms and programs during their execution. The method can detect an occurence of either stable global predicates or unstable strong or weak global predicates.
The paper presents a method can be used to verify properties of asynchronous distributed algorithms and programs during their execution. The method can detect an occurence of either stable global predicates or unstable strong or weak global predicates. (en)