1. Aceto, L. and Hennessy, M. (1991). Adding action refinement to a finite process algebra. Lecture Notes in Computer Science, 510: 506519.
2. Brookes, S. D., Hoare, C. A. R., and Roscoe, A. W. (1984). A theory of communicating sequential processes. Journal of the ACM, 31 (3): 560–599.
3. Bryant, R. (1986). Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8): 677–691.
4. Clarke, E., Grumberg, D., and Long, D. (1994). Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems, 16 (5): 1512–1542.
5. Clarke, E. M. and Wing, J. M. (1996). Formal methods: State of the art and future directions. Technical Report CMU-CS-96–178. ftp://reports.adm.cs.cmu.edu/usr/anon/1996/CMU-CS-96–178.ps.