P. C. Attie and E.A. Emerson. Synthesis of concurrent systems with many similar sequential processes. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pages 191-201, Austin, January 1989.
K. Apt and D. Kozen. Limits for automatic verification of finite-state concurrent sytems. Information Processing Letters, 22(6):307-309, 1986.
M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications, to appear, 1989.
S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(7):560-599, 1984.
E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite- state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986.
E. M. Clarke and O. Grümberg. Avoiding the state explosion problem in temporal logic model-checking algorithms. In Proc. 6th ACM Symposium on Principles of Distributed Computing, pages 294-303, Vancouver, British Columbia, August 1987.
E. M. Clarke, O. Grümberg, and M. C. Browne. Reasoning about networks with many identical finite-state processes. In Proc. 5th ACM Symposium on Principles of Distributed Computing, pages 240-248, Calgary, Alberta, August 1986.
E.A. Emerson and J.Y. Halpern. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM, 33(1):151-178, 1986.
S. Graf and J. Sifakis. A logic for the description of non-deterministic programs and their properties. Information and Control, 68(1-3):254-270, 1986.
S. German and A.P. Sistla. Reasoning with many processes. In Proc, Symp. on Logic in Computer Science, pages 138-152, Ithaca, June 1987.
M. Hennessy. Why testing equivalence is natural? Handwritten Note, April 1987.
R. P. Kurshan and M. McMillan. A structural induction theorem for processes. In Proceedings of the Eigth ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, August 1989.
P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes and three problems of equivalence. In Proceedings of the Second ACM Symposium on Principles of Distributed Computing, pages 228-240, Montreal, Quebec, August 1983.
Michael G. Main. Demons, catastrophies and communicating processes. Technical Report CU-CS-343-86, Department of Computer Science, University of Colorado, July 1986.
R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, Berlin, 1980.
E.R. Olderog. Process theory: Semantics, specification and verification. In Proc. Advanced School on Current Trends in Concurrency, pages 442-509, Berlin, 1985. Volume 224, LNCS, Springer-Verlag.
J. Parrow. Fairness Properties in Process Algebra. PhD thesis, University of Uppsala, Sweden, 1985.
A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
A. Sistla, E.M. Clarke, N. Francez, and Y. Gurevich. Can message buffers be characterised in linear temporal logic. In Proceedings of the First Symposium on Principles of Distributed Computing, Ottawa, Canada, August 1982.
R. J. van Glabbeek. Notes on the methodology of CCS and CSP. Technical Report CS-R8624, CWI Amsterdam, 1986.
P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1-2):72-99, 1983.
P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proc. 13th ACM Symp. on Principles of Programming, pages 184-192, St. Petersburgh, January 1986.
