Comparing two fully abstract dataflow models

This publication has 14 references indexed in Scilit:

• A fully abstract trace model for dataflow networks
  Published by Association for Computing Machinery (ACM) ,1989
• Nondeterministic data flow programs: How to avoid the merge anomaly
  Science of Computer Programming, 1988
• Hierarchical correctness proofs for distributed algorithms
  Published by Association for Computing Machinery (ACM) ,1987
• Semantics of digital networks containing indeterminate modules
  Distributed Computing, 1986
• Semantics of networks containing indeterminate operators
  Published by Springer Nature ,1985
• On the suitability of trace semantics for modular proofs of communicating processes
  Theoretical Computer Science, 1985
• Proposition de semantique denotationnelle pour des reseaux de processus avec operateur de melange equitable
  Theoretical Computer Science, 1982
• On the composition of processes
  Published by Association for Computing Machinery (ACM) ,1982
• Proofs of Networks of Processes
  IEEE Transactions on Software Engineering, 1981
• Scenarios: A model of non-determinate computation
  Published by Springer Nature ,1981