The following pages link to Unbounded Non-determinism in CSP (Q4276178):
Displaying 22 items.
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Fixed points without completeness (Q674192) (← links)
- The fixed point theory of unbounded non-determinism (Q751807) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- Revivals, stuckness and the hierarchy of CSP models (Q1007236) (← links)
- Infinitary parallelism without unbounded nondeterminism in CSP (Q1323355) (← links)
- Action systems, unbounded nondeterminism, and infinite traces (Q1805399) (← links)
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies (Q2134814) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Handshake games (Q2864210) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- The Calculus of Handshake Configurations (Q3617732) (← links)
- The soundness and completeness of axioms for CSP processes (Q3975027) (← links)
- Classifying unbounded nondeterminism in CSP (Q3975028) (← links)
- (Q5028431) (← links)
- (Q5079748) (← links)
- An Alternative Order for the Failures Model (Q5285988) (← links)
- Communicating Sequential Processes. The First 25 Years (Q5709371) (← links)
- Communicating Sequential Processes. The First 25 Years (Q5709378) (← links)
- Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot (Q5875354) (← links)
- Unbounded nondeterminism in CSP (Q5887514) (← links)
