Part of the Lecture Notes in Computer Science book series (LNCS, volume 197)
Applications of topology to semantics of communicating processes
KeywordsInduction Hypothesis Transition System Compactness Theorem Unique Fixed Point Silent Transition
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [BaZ]J. W. de Bakker and J. F. Zucker, “Processes and the denotational semantics of concurrency,” Proc. 14th ACM Symp. on Theory of Computing, 153–158.Google Scholar
- [GR]W. Golson and W. Rounds, “Connections between two theories of concurrency: metric spaces and synchronization trees,” Tech. Rep. CRL-TR-3-83, Computing Research Laboratory, University of Michigan, 1983 (to appear in Inf. Control)Google Scholar
- [HM]M. Hennessy and R. Milner, “On observing Nondeterminism and Concurrency,” Proc. 7th ICALP, LNCS 85 (1980).Google Scholar
- [HBR]C. A. R. Hoare, S. D. Brookes, and W. Roscoe, “A mathematical model for communicating processes,” Report PRG-16, Programming Research Group, Oxford (1981). Also to appear in JACM.Google Scholar
- [M]R. Milner, “A calculus of communicating systems,” LNCS 92, (1980).Google Scholar
- [OH]E. Olderog and C. A. R. Hoare, “Specification-oriented semantics for communicating processes,” Proc. 10th ICALP, LNCS 154 (1983), 561–572.Google Scholar
- [Ros]W. Roscoe, “A mathematical theory of communicating processes,” D.Phil. thesis, Oxford (1982).Google Scholar
- [Rou]W. Rounds, “On the relationships between Scott domains, synchronization trees, and metric spaces,” Tech. Rep. CRL-TR-25-83, Computing Research Laboratory, University of Michigan (1983).Google Scholar
- [S]M. Smyth, “Power domains and predicate transformers: a topological view,” Proc. 10th ICALP, LNCS 154 (1983), 662–675.Google Scholar
© Springer-Verlag 1985