The fixed point theory of unbounded non-determinism

DOI10.1007/BF01898399zbMATH Open0715.68027OpenAlexW2074872294MaRDI QIDQ751807FDOQ751807

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

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

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)

Cites Work

• Specification-oriented semantics for communicating processes
• Title not available (Why is that?)

Cited In (10)

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Communicating Sequential Processes. The First 25 Years
• Infinitary parallelism without unbounded nondeterminism in CSP
• Title not available (Why is that?)
• Fixed points without completeness
• Unbounded nondeterminism in CSP

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)