Recommendations
- Modeling the distributed termination convention of CSP
- A CSP model with flexible parallel termination semantics
- Termination of constraint logic programs
- scientific article; zbMATH DE number 1538008
- Termination of context-sensitive rewriting
- scientific article; zbMATH DE number 2080285
- scientific article; zbMATH DE number 2102742
- Conflict-driven conditional termination
- scientific article; zbMATH DE number 1088214
Cites work
- scientific article; zbMATH DE number 3902016 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- A CSP model with flexible parallel termination semantics
- A Theory of Communicating Sequential Processes
- A brief history of Timed CSP
- A timed model for communicating sequential processes
- Process Algebra
- Specification and Proof in Real Time CSP
- Termination, deadlock, and divergence
- The timed failures -- Stability model for CSP
- Understanding concurrent systems
- Unifying theories for logic programming
Cited in
(4)
This page was built for publication: Specifying termination in CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407510)