1. Parosh Aziz Abdulla and Bengt Jonsson. Undecidable verification problems for programs with unreliable channels. Inform. and Comput., 130(1):71–90, 1996.
2. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Inform. and Comput., 127(2):91–101, 1996.
3. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In CAV'96, LNCS 1102.
4. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. Available at http://www.montefiore.ulg.ac.be/~biogelot/research/BGWW97.ps.
5. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In SAS'97, LNCS 1997.