Of wlp and CSP

DOI10.1016/J.ENTCS.2009.12.016zbMATH Open1342.68229OpenAlexW2085929359MaRDI QIDQ2994489FDOQ2994489

Authors: Steve Dunne 

Publication date: 1 August 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.12.016

Recommendations

• A CSP model with flexible parallel termination semantics
• Step failures semantics and a complete proof system
• scientific article; zbMATH DE number 3990850
• Communicating Sequential Processes. The First 25 Years
• scientific article; zbMATH DE number 3928330

zbMATH Keywords

CSPCFFDintermediate correctnessstable failureswlp

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• General correctness: A unification of partial and total correctness
• Title not available (Why is that?)
• The weakest deadlock-preserving congruence
• Title not available (Why is that?)
• A state-based approach to communicating processes
• Process simulation and refinement
• Unifying wp and wlp

Cited In (3)

• Title not available (Why is that?)
• Step failures semantics and a complete proof system
• Communicating Sequential Processes. The First 25 Years

This page was built for publication: Of wlp and CSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994489)