1.

S. Aggarwal, R.P. Kurshan, and K.K. Sabnani, “A calculus for protocol specification and validation,” in*Protocol Specification, Testing and Verification III*, H. Ruden and C. West (Eds.), North-Holland, 1983, pp. 19–34.

2.

P.C. Attie and E.A. Emerson, “Synthesis of concurrent systems with many similar sequential processes,”*Proc. 16th Annual ACM Symp. on Principles of Programming Languages*, Austin, pp. 191–201, 1989.

3.

M.C. Browne, E.M. Clarke, and O. Grumberg, “Characterizing Kripke structures in temporal logic,”*Theoretical Computer Science*, Vol. 59, pp. 115–131, 1988.

4.

M.C. Browne, E.M. Clarke, and O. Grumberg, “Reasoning about many identical processes,”*Inform. and Comp.*, Vol. 81, No. 1, pp. 13–31, 1989.

5.

E.M. Clarke and E.A. Emerson, “Design and synthesis of synchronization skeletons using branching time temporal logic,” in*Proc. of the Workshop on Logics of Programs*, Yorktown Heights and D. Kozen (Eds.), LNCS#131, Springer-Verlag, pp. 52–71, May 1981.

6.

E.M. Clarke, E.A. Emerson, and A.P. Sistla, “Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach,”, in*Proc. 10th Annual ACM Symp. on Principles of Programming Languages*, Austin, 1983, pp. 117–126; also appeared in*ACM Transactions on Programming Languages and Systems*, Vol. 8, No. 2, pp. 244–263, 1986.

7.

E.M. Clarke, T. Filkorn, and S. Jha, “Exploiting symmetry in temporal logic model checking,” in*Proc. of 5th International Conference on Computer Aided Verification*, Elounda, Greece, June 1993, pp. 450–462.

8.

S. Duri, U. Buy, R. Devarapalli, and S. Shatz, “Using state space methods for deadlock analysis in ADA tasking,” in ACM*Proceedings of the 1993 International Symposium on Software Testing and Analysis*, June 1993, pp. 51–60.

9.

E.A. Emerson and E.M. Clarke, “Using branching time temporal logic to synthesize synchronization skeletons,”*Science of Computer Programming*, Vol. 2, pp. 241–266, 1982.

10.

E.A. Emerson, “Temporal and modal logic,” in*Handbook of Theoretical Computer Science*, Vol. B:*Formal Models and Semantics*, J. van Leeuwen (Ed.), Elsevier Science Publishers, pp. 995–1072, 1990.

11.

E.A. Emerson and A.P. Sistla, “Deciding full branching time logic,”*Information and Control*, Vol. 61, pp. 175–201, 1984.

12.

E.A. Emerson and A.P. Sistla, “Symmetry and model checking,” in*Proc. of 5th International Conference on Computer Aided Verification*, Elounda, Greece, June 1993, pp. 463–478.

13.

E.A. Emerson and A.P Sistla, “Utilizing symmetry when model checking under fairness assumptions,” University of Texas at Austin, Computer Sciences Tech. Report TR-94-17, April 1994.

14.

I. Herstein,*Topics in Algebra*, Xerox, 1964.

15.

C. Hoffmann, “Graph isomorphism and permutation groups,” Springer LNCS No. 132, 1982.

16.

C.-W.N. Ip and D.L. Dill, “Better verification through symmetry,” in*Proc. 11th International Symposium on Computer Hardware Description Languages (CHDL)*, April 1993.

17.

K. Jensen and G. Rozenberg (Eds.),*High-level Petri Nets: Theory and Application*, Springer-Verlag, 1991.

18.

Z. Kohavi,*Switching and Finite Automata Theory*, McGraw-Hill, 1978.

19.

R.P. Kurshan, “Testing containment of omega-regular languages,” Bell Labs Tech. Report 1121-861010-33 (1986); conference version in R.P. Kurshan,*Reducibility in Analysis of Coordination*, LNCIS 103 (1987) Springer-Verlag, 19–39.

20.

R.P. Kurshan,*Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach*, Princeton University Press, Princeton, New Jersey, 1994.

21.

D. Lee and M. Yannakakis, “Online minimization of transition systems,”*24th ACM Symposium on Theory of Computing*, Victoria, Canada, pp. 264–274, 1992.

22.

Z. Manna and A. Pnueli,*Temporal Logic of Reactive and Concurrent Systems: Specification*, Springer-Verlag, 1992.

23.

P.H. Starke, “Reachability analysis of petri nets using symmetries,”*Syst. Anal. Model. Simul.*, Akademic Verlag, Vol. 8, Nos. 4/5, pp. 293–303, 1991.

24.

C. Stirling, “Modal and temporal logics,” in*Handbook of Logic in Computer Science*, D. Gabbay (Ed.), pp. 1–85, Oxford, 1993.

25.

H. Weyl,*Symmetry*, Princeton Univ. Press, 1952.