摘要: A calculus for distributed computation is studied, based upon four combinators. A central idea is an Abelian group of actions which models the interfaces between components of a …
core.ac.uk
ed.ac.uk
elsevier.com
sci-hub.se 参考文章(16)
Robin Milner, Processes: A Mathematical Model of Computing Agents Logic Colloquium '73, Proceedings of the Logic Colloquium. ,vol. 80, pp. 157- 173 ,(1975) , 10.1016/S0049-237X(08)71948-7
David Park, Concurrency and Automata on Infinite Sequences Theoretical Computer Science. pp. 167- 183 ,(1981) , 10.1007/BFB0017309
Glynn Winskel, Event Structure Semantics for CCS and Related Languages international colloquium on automata, languages and programming. pp. 561- 576 ,(1982) , 10.1007/BFB0012800
Leslie Lamport, Sometime’ is Sometimes ‘Not Never’ ,(2016)
Luoa Cardelli, Real time agents international colloquium on automata, languages and programming. pp. 94- 106 ,(1982) , 10.1007/BFB0012760
Robin Milner, On relating synchrony and asynchrony University of Edinburgh. ,(1980)
M. C. B. Hennessy, G. D. Plotkin, A Term Model for CCS mathematical foundations of computer science. pp. 261- 274 ,(1980) , 10.1007/BFB0022510
Amir Pnueli, The temporal semantics of concurrent programs Theoretical Computer Science. ,vol. 13, pp. 45- 60 ,(1981) , 10.1016/0304-3975(81)90110-9
George Milne, Robin Milner, Concurrent Processes and Their Syntax Journal of the ACM. ,vol. 26, pp. 302- 321 ,(1979) , 10.1145/322123.322134
Robin Milner, Four combinators for concurrency principles of distributed computing. pp. 104- 110 ,(1982) , 10.1145/800220.806687