A fully observational model for infinite behaviours of communicating systems-Reference-Cited by-同舟云学术

A fully observational model for infinite behaviours of communicating systems

Published:1987 Issue: Volume: Page:153-168
ISSN:0302-9743
Container-title:TAPSOFT '87
language:
Short-container-title:

Author:

Darondeau Ph.,Gamatie B.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-17660-8_54.pdf

Reference28 articles.

1. Abramsky S. Experiments, Power domains, and Fully Abstract Models for Applicative Multiprogramming FCT 83, Borgholm Springer-Verlag, LNCS 158 (83) pp. 1–13

2. Arnold A., Dicky A. An Algebraic Characterization of Transition System Equivalence, Report I-8603, Université de Bordeaux (86)

3. Bekić H. Definable Operations in General Algebras, and the Theory of Automata and Flowcharts, IBM Laboratory Vienna (69) also in: Programming Languages and their Definition, selected papers of H. Bekić, Springer-Verlag LNCS 177(84)

4. Bergstra J.A., Klop J.W., Olderog E.R. Readies and Failures in the Algebra of Communicating Processes, Report CS-R8523, CWI, Amsterdam (85)

5. Boasson L., Nivat M. Adherences of Languages, JCSS 20 (80) pp. 285–309

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

1. Concurrency and computability;Semantics of Systems of Concurrent Processes;1990

2. Causal trees interleaving + causality;Semantics of Systems of Concurrent Processes;1990

3. Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science;Algebraic Techniques;1989

4. Causal trees;Automata, Languages and Programming;1989

5. Algebraically closed theories;Lecture Notes in Computer Science;1989