An Introduction to Milner ’ s CCS
暂无分享,去创建一个
[1] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[2] Kim G. Larsen,et al. Proof Systems for Satisfiability in Hennessy-Milner Logic with Recursion , 1990, Theor. Comput. Sci..
[3] Jos C. M. Baeten,et al. A brief history of process algebra , 2005, Theor. Comput. Sci..
[4] Kim G. Larsen,et al. Graphical Versus Logical Specifications , 1990, Theoretical Computer Science.
[5] Gordon D. Plotkin,et al. A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..
[6] Jan A. Bergstra,et al. On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..
[7] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[8] Gordon D. Plotkin,et al. The origins of structural operational semantics , 2004, J. Log. Algebraic Methods Program..
[9] Dexter Kozen,et al. RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .
[10] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .
[11] Fred Kröger,et al. Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.
[12] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[13] Rob J. van Glabbeek,et al. The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.
[14] Robert M. Keller,et al. Formal verification of parallel programs , 1976, CACM.
[15] Amir Pnueli,et al. On the Development of Reactive Systems , 1989, Logics and Models of Concurrent Systems.
[16] R. J. vanGlabbeek. The linear time - branching time spectrum , 1990 .
[17] Flemming Nielson,et al. Semantics with applications - a formal introduction , 1992, Wiley professional computing.
[18] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.