@inproceedings{b2dc9e82f1724ef7832ef5ae76d6a720,
title = "Efficient symbolic detection of global properties in distributed systems",
abstract = "A new approach is presented for detecting whether a computation of an asynchronous distributed system satisfies PossΦ (read {"}possibly Φ{"}), meaning the system could have passed through a global state satisfying property Φ. Previous general-purpose algorithms for this problem explicitly enumerate the set of global states through which the system could have passed during the computation. The new approach is to represent this set symbolically, in particular, using ordered binary decision diagrams. We describe an implementation of this approach, suitable for off-line detection of properties, and compare its performance to the enumeration-based algorithm of Alagar \& Venkatesan. In typical cases, the new algorithm is significantly faster. We have measured over 400-fold speedup in some cases.",
author = "Stoller, \{Scott D.\} and Liu, \{Yanhong A.\}",
year = "1998",
doi = "10.1007/bfb0028758",
language = "English",
isbn = "3540646086",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "357--368",
booktitle = "Computer Aided Verification - 10th International Conference, CAV'98, Proceedings",
note = "10th International Conference on Computer-Aided Verification, CAV'98 ; Conference date: 28-06-1998 Through 02-07-1998",
}