CCS without τ's-Reference-Cited by-同舟云学术

CCS without τ's

Published:1987 Issue: Volume: Page:138-152
ISSN:0302-9743
Container-title:TAPSOFT '87
language:
Short-container-title:

Author:

Nicola Rocco,Hennessy Matthew

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-17660-8_53.pdf

Reference20 articles.

1. Austry, D. and Boudol, G. Algebre de Processus et Synchronization. Theoret. Comput. Sci. Vol. 30, No. 1 North Holland, Amsterdam, (1984).

2. de Bakker, J. and Zucker, J., Processes and the Denotational Semantics of Concurrency. Information and Control, Vol 44, Nos. 1–2, pp.136–176, (1982).

3. Brookes,S.D. A Model for Communicating Sequential Processes. Ph.D. Thesis, University of Oxford. Also Carnegie Mellon University Internal Report, CMU-CS-149, (1983).

4. Brookes, S.D., Hoare, C.A.R. and Roscoe, A.D. A Theory of Communicating Sequential Processes. Journal of ACM, Vol. 31, No. 3, pp. 560–599, (1984).

5. Begstra, J. and Klop, G. Process Algebra for Synchronous Communication, Information and Control, Vol 60, pp.109–137, (1984).

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

1. Nondeterminism and Guarded Commands;Edsger Wybe Dijkstra;2022-07-12

2. Translation of CCS into CSP, Correct up to Strong Bisimulation;Software Engineering and Formal Methods;2021

3. Two notions of sub-behaviour for session-based client/server systems: 10 Years Later;22nd International Symposium on Principles and Practice of Declarative Programming;2020-09-08

4. A Note On Compliance Relations And Fixed Points.;Electronic Proceedings in Theoretical Computer Science;2019-09-12

5. An Equational Characterisation of the Must Testing Pre-order for Regular Processes;Models, Languages, and Tools for Concurrent and Distributed Programming;2019