Unbounded Non-determinism in CSP
From MaRDI portal
Publication:4276178
DOI10.1093/logcom/3.2.131zbMath0801.68113OpenAlexW2156547868MaRDI QIDQ4276178
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
Related Items (12)
There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations ⋮ Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ Process Algebra and Model Checking ⋮ SAT-solving in CSP trace refinement ⋮ Unnamed Item ⋮ Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot ⋮ Fixed points without completeness ⋮ Unnamed Item ⋮ The Calculus of Handshake Configurations ⋮ Revivals, stuckness and the hierarchy of CSP models ⋮ Action systems, unbounded nondeterminism, and infinite traces ⋮ Handshake Games
This page was built for publication: Unbounded Non-determinism in CSP