Author:
Jonsson Bengt,Kok Joost N.
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. J. D. Brock and W. B. Ackerman. Scenarios: a model of non-determinate computation. In Diaz and Ramos, editors, Formalization of Programming Concepts, LNCS 107, pages 252–259, Springer Verlag, 1981.
2. R. J. 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.
3. F. Boussinot. Proposition de semantique denotationelle pour des processus avec operateur de melange equitable. Theoretical Computer Science, 18(2):173–206, 1982.
4. M. Broy. Fixed point theory for communication and concurrency. In Bjoerner, editor, Formal Description of Programming Concepts II, pages 125–146, North-Holland, Amsterdam, 1983.
5. M. Broy. Nondeterministic data flow programs: how to avoid the merge anomaly. Science of Computer Programming, 10:65–85, 1988.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献