The fixed point theory of unbounded non-determinism

DOI10.1007/BF01898399zbMath0715.68027OpenAlexW2074872294MaRDI QIDQ751807

Geoff Barrett

Publication date: 1991

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01898399

zbMATH Keywords

fixed point theoryinfinite traces modellanguage of communicating sequential processesrecursive process theorysemantics of concurrencyunbounded non-determinism

Mathematics Subject Classification ID

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

Related Items

There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations ⋮ Fixed points without completeness ⋮ Revivals, stuckness and the hierarchy of CSP models ⋮ Infinitary parallelism without unbounded nondeterminism in CSP

Cites Work

• Unnamed Item
• Specification-oriented semantics for communicating processes