Specifying termination in CSP
DOI10.1016/J.TCS.2013.05.008zbMATH Open1360.68632OpenAlexW1991632479MaRDI QIDQ407510FDOQ407510
Authors: Paul Howells, Mark d'Inverno 
Publication date: 2 September 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.008
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
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A timed model for communicating sequential processes
- Termination, deadlock, and divergence
- Unifying theories for logic programming
- A Theory of Communicating Sequential Processes
- Process Algebra
- Understanding concurrent systems
- A CSP model with flexible parallel termination semantics
- The timed failures -- Stability model for CSP
- Title not available (Why is that?)
- Specification and Proof in Real Time CSP
- A brief history of Timed CSP
Cited In (3)
Uses Software
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)
