A CSP model with flexible parallel termination semantics

DOI10.1007/S00165-008-0098-ZzbMath1192.68429OpenAlexW2029102226MaRDI QIDQ1037248

Mark d'Inverno, Paul Howells

Publication date: 13 November 2009

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-008-0098-z

zbMATH Keywords

CSPterminationconcurrency

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (1)

Specifying termination in CSP

Uses Software

• FDR2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A brief history of Timed CSP
• Specification and Proof in Real Time CSP
• Termination, deadlock, and divergence
• An Alternative Order for the Failures Model

This page was built for publication: A CSP model with flexible parallel termination semantics