M. Browne, E. Clarke, and O. Grumberg, “Characterizing finite Kripke structures in propositional temporal logic,”Theoretical Comput. Sci., Vol. 59, pp. 115–131, 1988.
R.E. Bryant, “Graph-based algorithms for boolean function manipulation,”IEEE Trans. Comput., Vol. C-35, No. 8, 1986.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang, ‘Symbolic model checking: 1020 states and beyond,” inProc. 5th Ann. Symp. on Logic in Comput. Sci., IEEE Comp. Soc. Press, June 1990.
L. Claesen (Ed.),Proc. 11th Int. Symp. on Comput. Hardware Description Lang. and their Applications, North-Holland, Apr. 1993.
E.M. Clarke, E.A. Emerson, and A.P. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic specifications,”ACM Trans. Prog. Lang. Syst., Vol. 8, No. 2, pp. 244–263, 1986.
E.M. Clarke, O. Grumberg, H. Hiraishi, S. Jha, D.E. Long, K.L. McMillan, and L.A. Ness, “Verification of the Futurebus + cache coherence protocol,” to appear inProc. 11th Int. Symp. on Comput. Hardware Description Lang, and their Applications, Apr. 1993.
E.A. Emerson and A.P. Sistla, “Symmetry and model checking,” inProc. Fifth Workshop on Comput.-Aided Verification, C. Courcabetis (Ed.), June 1993.
E. Felt, G. York, R. Brayton, and A.S. Vincentelli, “Dynamic variable reordering for bdd minimiation,” inProc. EuroDAC, pp. 130–135, Sept. 1993.
M. Furst, J. Hopcroft, and E. Luks, “Polynomial-time algorithms for permutations groups,” inProc. 21st Ann. Symp. on Found. of Comput. Sci., 1980.
M. Garey and D. Johnson,Computers and Intractibility, W.H. Freeman and Company, 1979.
P. Huber, A. Jensen, L. Jepsen, and K. Jensen, “Towards reachability trees for high-level Petri nets,” inAdvances on Petri Nets, G. Rozenberg (Ed.), pp. 215–233, 1984.
S.L. Hurst, D.M. Miller, and J.C. Muzio,Special Techniques in Digital Logic, Academic Press, Inc., 1985.
IEEE Computer Society,IEEE Standard for Futurebus +—Logical Protocol Specification, Mar. 1992. IEEE Standard 896.I-1991.
C. Ip and D. Dill, “Better verification through symmetry,” to appear inProc. 11th Int. Symp. on Compuct. Hardware Description Lang. and their Applications, Apr. 1993.
R.P. Kurshan, “Testing containment of ω-regular languages,” Technical Report 1121-861010-33-TM, Bell Laboratories, 1986.
B. Lin and A.R. Newton, “Efficient symbolic manipulation of equivalence relations and classes,” inProc. 1991 Int. Workshop on Format Methods in VLSI Design, Jan. 1991.
K.L. McMillan and J. Schwalbe, “Formal verification of the Gigamax cache consistency protocol,” inShared Memory Multiprocessing, N. Suzuki (Ed.), MIT Press, 1992.
R. Rudell, “Dynamic variable reordering for ordered binary decision diagrams,” inProc. IEEE ICCAD, pp. 42–47, Nov. 1993.
P. Starke, “Reachability analysis of petri nets using symmetries,”Syst. Anal. Model. Simul., Vol. 8, Nos. 4/5, pp. 293–303, 1991.