Author:
Jonsson Bengt,Kok Joost N.
Publisher
Springer Berlin Heidelberg
Reference37 articles.
1. R. Back and H. Mannila. On the suitability of trace semantics for modular proofs of communicating processes. Theoretical Computer Science, 39(1):47–68, 1985.
2. F. Boussinot. Proposition de semantique denotationelle pur des processus avec operateur de melange equitable. Theoretical Computer Science, 18(2):173–206, 1982.
3. J. Brock and W. Ackerman. Scenarios: a model of non-determinate computation. In Formalization of Programming Concepts, LNCS 107, pages 252–259. 1981.
4. S. Brookes, C. Hoare, and A. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560–599, 1984.
5. M. Broy. Fixed point theory for communication and concurrency. In Bjoerner, editor, Formal Description of Programming Concepts II, pages 125–146, 1983. North-Holland.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Linear dynamic Kahn networks are deterministic;Mathematical Foundations of Computer Science 1996;1996