A model of concurrency with fair merge and full recursion

DOI10.1016/0890-5401(91)90054-6zbMath0732.68037OpenAlexW2115880227MaRDI QIDQ808690

Yiannis N. Moschovakis

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90054-6

zbMATH Keywords

denotational semantics for non-deterministic languagesnon-deterministic processes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items

Fairness, Resources, and Separation ⋮ 1994 Annual Meeting of the Association for Symbolic Logic ⋮ Computable concurrent processes ⋮ Games and winning strategies ⋮ The logic of recursive equations

Cites Work

• Computable concurrent processes
• Calculi for synchrony and asynchrony
• A theory for nondeterminism, parallelism, communication, and concurrency
• Modeling concurrency with partial orders
• A calculus of communicating systems
• Power domains
• The formal language of recursion
• A Powerdomain Construction
• Communicating sequential processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A model of concurrency with fair merge and full recursion