A model of concurrency with fair merge and full recursion
- 1 July 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 93 (1) , 114-171
- https://doi.org/10.1016/0890-5401(91)90054-6
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The formal language of recursionThe Journal of Symbolic Logic, 1989
- A theory for nondeterminism, parallelism, communication, and concurrencyTheoretical Computer Science, 1986
- Modeling concurrency with partial ordersInternational Journal of Parallel Programming, 1986
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Communicating sequential processesCommunications of the ACM, 1978
- Power domainsJournal of Computer and System Sciences, 1978
- A Powerdomain ConstructionSIAM Journal on Computing, 1976