The fixed point theory of unbounded non-determinism

DOI10.1007/BF01898399MaRDI QIDQ751807zbMATH OpenOpenAlexFDO

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

Recommendations

• Unbounded Non-determinism in CSP
• scientific article; zbMATH DE number 17696
• Fixed points without completeness
• Unbounded nondeterminism in CSP
• scientific article; zbMATH DE number 17697

Cites work

• scientific article; zbMATH DE number 17697 (Why is no real title available?)
• Specification-oriented semantics for communicating processes

Cited in

(10)

• Unbounded nondeterminism in CSP
• There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
• Fixed point equations with parameters in the projective model
• Revivals, stuckness and the hierarchy of CSP models
• scientific article; zbMATH DE number 17696 (Why is no real title available?)
• scientific article; zbMATH DE number 17697 (Why is no real title available?)
• Communicating Sequential Processes. The First 25 Years
• Infinitary parallelism without unbounded nondeterminism in CSP
• scientific article; zbMATH DE number 1948158 (Why is no real title available?)
• Fixed points without completeness

This page was built for publication: The fixed point theory of unbounded non-determinism

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