Specifying termination in CSP

DOI10.1016/j.tcs.2013.05.008zbMath1360.68632OpenAlexW1991632479MaRDI QIDQ407510

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

zbMATH Keywords

CSPterminationconcurrencyparallel operators

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• FDR2

Cites Work

• A brief history of Timed CSP
• A CSP model with flexible parallel termination semantics
• A timed model for communicating sequential processes
• The timed failures -- Stability model for CSP
• Understanding concurrent systems
• A Theory of Communicating Sequential Processes
• Process Algebra
• Specification and Proof in Real Time CSP
• Termination, deadlock, and divergence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Specifying termination in CSP