The following pages link to Unbounded Non-determinism in CSP (Q4276178):
Displayed 11 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)
- Revivals, stuckness and the hierarchy of CSP models (Q1007236) (← links)
- Action systems, unbounded nondeterminism, and infinite traces (Q1805399) (← links)
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies (Q2134814) (← links)
- Handshake Games (Q2864210) (← links)
- Process Algebra and Model Checking (Q3176390) (← links)
- The Calculus of Handshake Configurations (Q3617732) (← links)
- (Q5028431) (← links)
- (Q5079748) (← links)