Infinite streams and finite observations in the semantics of uniform concurrency
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 49 (2-3) , 87-112
- https://doi.org/10.1016/0304-3975(87)90002-8
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Merging regular processes by means of fixed-point theoryTheoretical Computer Science, 1986
- Linear time and branching time semantics for recursion with mergeTheoretical Computer Science, 1984
- A linear-history semantics for languages for distributed programmingTheoretical Computer Science, 1984
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- Testing equivalences for processesTheoretical Computer Science, 1984
- Process algebra for synchronous communicationInformation and Control, 1984
- A continuous semantics for unbounded nondeterminismTheoretical Computer Science, 1983
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Processes and the denotational semantics of concurrencyInformation and Control, 1982
- Semantics of nondeterminism, concurrency, and communicationJournal of Computer and System Sciences, 1979