Output details
11 - Computer Science and Informatics
Goldsmiths' College
A CSP model with flexible parallel termination semantics
<10> A well-respected journal in formal methods; the paper was subject to a rigorous review process that led to significant improvements. It contains a complete treatment of successful process termination in CSP, particularly in terms of parallel termination in response to widely-recognised problems in the original semantics of Hoare’s CSP which permitted unnatural and undesired processes to appear. This paper presents a solution these original problems that is closer to the original semantic model of Hoare than the solutions propsed by Hoare, Brookes and Roscoe. Ours provides greater flexibility over the type of parallel termination semantics available in CSP.