Unfolding CSP
暂无分享,去创建一个
[1] Robin Milner,et al. Synthesis of Communicating Behaviour , 1978, MFCS.
[2] Andrew William Roscoe,et al. The Theory and Practice of Concurrency , 1997 .
[3] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[4] Bill Roscoe,et al. On the expressiveness of CSP , 2011 .
[5] C. K. R. T. Jones,et al. The ϱ-Calculus , 1981, Math. Log. Q..
[6] Gordon D. Plotkin,et al. A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..
[7] Zohar Manna,et al. Proving termination with multiset orderings , 1979, CACM.
[8] Bill Roscoe,et al. An Operational Semantics for CSP , 1986 .
[9] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.
[10] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.
[11] A. R. D. Mathias,et al. NON‐WELL‐FOUNDED SETS (CSLI Lecture Notes 14) , 1991 .
[12] Rocco De Nicola. Two Complete Axiom Systems for a Theory of Communicating Sequential Processes , 1985, Inf. Control..