1. Lect Notes Comput Sci;P.A. Abdulla,1999
2. Lect Notes Comput Sci;P.A. Abdulla,2001
3. Abdulla P.A, Jonsson B.: Ensuring Completeness of Symbolic Verification Methods for Infinite-State Systems. Theoretical Computer Science, Vol 256. (2001) 145–167
4. Lect Notes Comput Sci;A. Annichini,2000
5. Bauer G., Paulitsch M.: An investigation of membership and clique avoidance in TTP/C. Proceedings 19th IEEE Symposium on Reliable Distributed Systems (SRDS’00), IEEE Computer Society, (2000), 118–124