Merging regular processes by means of fixed-point theory
- 31 December 1986
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 45, 193-260
- https://doi.org/10.1016/0304-3975(86)90045-9
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- 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 continuous semantics for unbounded nondeterminismTheoretical Computer Science, 1983
- On finite computations in denotational semanticsTheoretical Computer Science, 1983
- Processes and the denotational semantics of concurrencyInformation and Control, 1982
- Fixed point theorems and semantics: a folk taleInformation Processing Letters, 1982
- A term model for synchronous processesInformation and Control, 1981
- Semantics of nondeterminism, concurrency, and communicationJournal of Computer and System Sciences, 1979
- On the existence of optimal fixpointsTheory of Computing Systems, 1979
- Theory of ω-languagesI: Characterizations of ω-context-free languagesJournal of Computer and System Sciences, 1977