Kahn's fixed-point characterization for linear dynamic networks-Reference-Cited by-同舟云学术

Kahn's fixed-point characterization for linear dynamic networks

Published:1997 Issue: Volume: Page:513-522
ISSN:0302-9743
Container-title:SOFSEM'97: Theory and Practice of Informatics
language:
Short-container-title:

Author:

Nienhuys-Cheng Shan-Hwei,de Bruin Arie

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63774-5_133

Reference9 articles.

1. A. Arnold, Sémantique des processus communicants, RAIRO Theor.Inf. 15,2, pp.103–139, 1981.

2. J. W. de Bakker, F. van Brengel and A. de Bruin, Comparative semantics for linear arrays of communicating processes, a study of the UNIX fork and pipe commands, in: A.M. Borzyszkowski and S. Sokolowski (eds.) Proc. Math. Foundations of Computer Science, LNCS 711, pp.252–261 Springer, 1993.

3. J. W. de Bakker, E. de Vink, Control Flow Semantics, MIT press, 1996.

4. A. de Bruin, S. H. Nienhuys-Cheng, Linear dynamic Kahn networks are deterministic, in: W. Penczek, A. Szalas (Eds.), Proc. Math. Foundations of Computer Science, LNCS 1113, pp.242–254, Springer, 1996.

5. A. de Bruin, S. H. Nienhuys-Cheng, Linear dynamic Kahn networks are deterministic, complete version of [BN96]. Accepted by Theoretical Computer Science, 1997, special issue for MFCS96. It is based on a technical report, Erasmus University Rotterdam. (http://kaa.cs.few.eur.nl/few/inf/publicaties/rapporten/eur-few-cs-94-06.html).

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Linear dynamic Kahn networks are deterministic;Theoretical Computer Science;1998-03

2. Distances and limits on Herbrand interpretations;Inductive Logic Programming;1998