CSP is Expressive Enough for π-Reference-Cited by-同舟云学术

CSP is Expressive Enough for π

Published:2010 Issue: Volume: Page:371-404
ISSN:
Container-title:Reflections on the Work of C.A.R. Hoare
language:
Short-container-title:

Author:

Roscoe A. W.

Publisher

Springer London

Link

http://link.springer.com/content/pdf/10.1007/978-1-84882-912-1_16

Reference26 articles.

1. Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: the Spi calculus. Proceedings of the 4th ACM conference on Computer and communications security (1997).

2. Brookes, S.D.: A model for Communicating Sequential Processes. Oxford University DPhil thesis (1983).

3. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating Sequential Processes. Appeared as monograph PRG-16, 1981. http://web.comlab.ox.ac.uk/people/Bill.Roscoe/publications/1.pdf and extended in JACM 31, pp. 560–599 (1984).

4. Brookes, S.D., Roscoe, A.W., Walker, D.J.: An operational semantics for CSP. Oxford University Technical Report (1986).

5. He, J., Hoare, C.A.R.: CCS is a retract of CCS. Unifying Theories of Programming symposium, Springer LNCS 4010 (2006).

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Toward Verifying Cooperatively Scheduled Runtimes Using CSP;Formal Aspects of Computing;2023-11-21

2. Comparing the Expressiveness of the π-calculus and CCS;ACM Transactions on Computational Logic;2023-11-18

3. Comparing the expressiveness of the $$\pi $$-calculus and CCS;Programming Languages and Systems;2022

4. Denotational semantics of channel mobility in UTP-CSP;Formal Aspects of Computing;2021-08

5. Process Algebra and Model Checking;Handbook of Model Checking;2018