Author:
Boer Frank S.,Palamidessi Catuscia
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. J.C.M. Baeten, J.A. Bergstra, and J.-W. Klop. On the consistency of Koomen's fair abstraction rule. Theoretical Computer Science, 51(1,2):129–176, 1987.
2. J.A. Bergstra and J.-W. Klop. Process algebra: specification and verification in bisimulation semantics. In Mathematics and Computer Science II, CWI Monographs, pages 61–94. North-Holland, 1986.
3. L. Bougé. On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes. Acta Informatica, 25:179–201, 1988.
4. S.D. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. Journal of ACM, 31:499–560, 1984.
5. A.K. Chandra and Z. Manna. The power of programming features. J. Computer Languages, 1:219–232, 1975.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Comparing Process Calculi Using Encodings;Electronic Proceedings in Theoretical Computer Science;2019-08-22
2. Breaking symmetries;Mathematical Structures in Computer Science;2014-11-12
3. State—and Event-Based Reactive Programming in Shared Dataspaces;Lecture Notes in Computer Science;2002
4. Towards a Hierarchy of Negative Test Operators for Generative Communication;Electronic Notes in Theoretical Computer Science;1998
5. On the Expressiveness of Linda-like Concurrent Languages;Electronic Notes in Theoretical Computer Science;1998