Unbounded Non-determinism in CSP

DOI10.1093/LOGCOM/3.2.131zbMATH Open0801.68113OpenAlexW2156547868MaRDI QIDQ4276178FDOQ4276178

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

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

zbMATH Keywords

CSPcompletenessfixed pointsrecursionoperational semanticsinfinite tracesunbounded non-determinism

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cited In (21)

• Process algebra and model checking
• The Calculus of Handshake Configurations
• Title not available (Why is that?)
• There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
• Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot
• SAT-solving in CSP trace refinement
• Communicating Sequential Processes. The First 25 Years
• Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
• The fixed point theory of unbounded non-determinism
• Revivals, stuckness and the hierarchy of CSP models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nondeterministic unitary OBDDs
• Communicating Sequential Processes. The First 25 Years
• Action systems, unbounded nondeterminism, and infinite traces
• Title not available (Why is that?)
• Dual unbounded nondeterminacy, recursion, and fixpoints
• Handshake games
• Fixed points without completeness
• Unbounded nondeterminism in CSP

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)