The expressive power of indeterminate dataflow primitives
Open Access
- 1 May 1992
- journal article
- Published by Elsevier in Information and Computation
- Vol. 98 (1) , 99-131
- https://doi.org/10.1016/0890-5401(92)90043-f
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A proof of the Kahn principle for input/output automataInformation and Computation, 1989
- Concurrent transition systemsTheoretical Computer Science, 1989
- Theory of tracesTheoretical Computer Science, 1988
- Hierarchical correctness proofs for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1987
- Semantics of digital networks containing indeterminate modulesDistributed Computing, 1986
- Countable nondeterminism and random assignmentJournal of the ACM, 1986
- Proof rules and transformations dealing with fairnessScience of Computer Programming, 1983
- A Powerdomain ConstructionSIAM Journal on Computing, 1976