R. Cleveland, Tableau-Based Model Checking in the Propositional Mu-Calculus, typewritten paper 1988.
R. Cleaveland, J. Parrow and B. Steffen, The Concurrency Workbench, to appear.
E. Emerson and C. Lei, Efficient model checking in fragments of the propositional mu-calculus, Proc. Symposium on Logic in Computer Science, Cambridge, Mass., 267–278, 1986.
S. Graf and J. Sifakis, A modal characterization of observational congruence of finite terms of CCS
, Information and Control 68, 125–145, 1986.Google Scholar
M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency
, JACM 32, 137–161, 1985.Google Scholar
S. Holmström, Hennessy-Milner Logic with Recursion as a Specification Language, and a Refinement Calculus based on it, Report 44 Programming Methodology Group, University of Göteborg, 1988.
D. Knuth, Additional Comments on a Problem in Concurrent Programming Control, Comm. ACM 9/5, 1966.
D. Kozen, Results on the propositional mu-calculus
, Theoretical Computer Science 27, 333–354, 1983.Google Scholar
K. Larsen, Proof systems for Hennessy-Milner logic with recursion, Proc. CAAP 1988.
R. Milner, A Calculus of Communicating Systems, Springer Lecture Notes ion Computer Science, vol. 92, 1980.
A. Pnueli, Specification and development of reactive systems, Information Processing 86, North-Holland, 854–858, 1986.
V. Pratt, A decidable μ-calculus, Proc. 22nd. FOCS, 421–27, 1981.
B. Steffen, Characteristic formulae, University of Edinburgh report, 1988.
C. Stirling, Modal Logics for Communicating Systems
, Theoretical Computer Science 49, 311–347, 1987.Google Scholar
C. Stirling, Temporal Logics for CCS, to appear in Proc. of REX Workshop, 1988.
D. Walker, Automated Analysis of Mutual Exclusion Algorithms Using CCS, submitted for publication, 1988.