A model of concurrency with fair merge and full recursion
type: Item
instance of: scholarly article
title: A model of concurrency with fair merge and full recursion
zbMATH Open document ID: 0732.68037
DOI: 10.1016/0890-5401(91)90054-6
author: Yiannis N. Moschovakis
published in: Information and Computation
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 4211489
zbMATH Keywords: denotational semantics for non-deterministic languages
zbMATH Keywords: non-deterministic processes
MaRDI profile type: Publication
full work available at URL: 0890-5401(91)90054-6
OpenAlex ID: W2115880227
cites work: A theory for nondeterminism, parallelism, communication, and concurrency
cites work: Q4144755
cites work: Communicating sequential processes
cites work: Q4054644
cites work: Q4151149
cites work: A calculus of communicating systems
cites work: Calculi for synchrony and asynchrony
cites work: The formal language of recursion
cites work: Q3204036
cites work: Computable concurrent processes
cites work: Q3906397
cites work: Q3042377
cites work: A Powerdomain Construction
cites work: Q4205072
cites work: Modeling concurrency with partial orders
cites work: Power domains
description: scientific article; zbMATH DE number 4211489