Unbounded Non-determinism in CSP

DOI10.1093/LOGCOM/3.2.131MaRDI QIDQ4276178zbMATH OpenOpenAlexFDO

Authors A. W. Roscoe

Publication date 29 November 1994

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/3.2.131

zbMATH Keywords

completenessCSPfixed pointsinfinite tracesoperational semanticsrecursionunbounded non-determinism

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Unbounded nondeterminism in CSP
• scientific article; zbMATH DE number 17697
• Infinitary parallelism without unbounded nondeterminism in CSP
• Nondeterminism and infinite computations in constraint programming
• scientific article; zbMATH DE number 4123706
• Sequential algorithms for unbounded nondeterminism
• Bounded nondeterminism of logic programs
• Classes of bounded nondeterminism
• scientific article; zbMATH DE number 1231470
• The satisfiability problem for unbounded fragments of probabilistic CTL

Cited in

(23)

• Revivals, stuckness and the hierarchy of CSP models
• Infinitary parallelism without unbounded nondeterminism in CSP
• Action systems, unbounded nondeterminism, and infinite traces
• Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
• Nondeterministic unitary OBDDs
• Handshake games
• There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
• Process algebra and model checking
• The Calculus of Handshake Configurations
• scientific article; zbMATH DE number 17696 (Why is no real title available?)
• scientific article; zbMATH DE number 17697 (Why is no real title available?)
• SAT-solving in CSP trace refinement
• scientific article; zbMATH DE number 1760049 (Why is no real title available?)
• Extensional and intensional semantics of bounded and unbounded nondeterminism
• A fully abstract game semantics for countable nondeterminism
• An Alternative Order for the Failures Model
• Communicating Sequential Processes. The First 25 Years
• Communicating Sequential Processes. The First 25 Years
• Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
• Unbounded nondeterminism in CSP
• Fixed points without completeness
• The fixed point theory of unbounded non-determinism
• Dual unbounded nondeterminacy, recursion, and fixpoints

This page was built for publication: Unbounded Non-determinism in CSP

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