A model of concurrency with fair merge and full recursion

DOI10.1016/0890-5401(91)90054-6MaRDI QIDQ808690zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3837349 (Why is no real title available?)
• scientific article; zbMATH DE number 4180791 (Why is no real title available?)
• scientific article; zbMATH DE number 3714908 (Why is no real title available?)
• scientific article; zbMATH DE number 3469994 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 3581600 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• A Powerdomain Construction
• A calculus of communicating systems
• A theory for nondeterminism, parallelism, communication, and concurrency
• Calculi for synchrony and asynchrony
• Communicating sequential processes
• Computable concurrent processes
• Modeling concurrency with partial orders
• Power domains
• The formal language of recursion

Cited in

(7)

• Fairness, resources, and separation
• Merging regular processes by means of fixed-point theory
• 1994 Annual Meeting of the Association for Symbolic Logic
• scientific article; zbMATH DE number 4180791 (Why is no real title available?)
• 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)