A model of concurrency with fair merge and full recursion

DOI10.1016/0890-5401(91)90054-6zbMATH Open0732.68037OpenAlexW2115880227MaRDI QIDQ808690FDOQ808690

Authors: 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

Recommendations

• scientific article
• scientific article; zbMATH DE number 1223630
• Computable concurrent processes
• scientific article; zbMATH DE number 1231566
• scientific article; zbMATH DE number 3903948

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)

Cites Work

• Title not available (Why is that?)
• Calculi for synchrony and asynchrony
• A theory for nondeterminism, parallelism, communication, and concurrency
• Modeling concurrency with partial orders
• A calculus of communicating systems
• Title not available (Why is that?)
• A Powerdomain Construction
• Communicating sequential processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Power domains
• The formal language of recursion
• Title not available (Why is that?)
• Computable concurrent processes
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Merging regular processes by means of fixed-point theory
• Fairness, Resources, and Separation
• 1994 Annual Meeting of the Association for Symbolic Logic
• Title not available (Why is that?)
• The logic of recursive equations
• Computable concurrent processes
• Games and winning strategies

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808690)