Book
Termination without $\checkmark$ in CSP
| Title: | Termination without $\checkmark$ in CSP |
|---|---|
| Authors: | Steve Dunne |
| Source: | Lecture Notes in Computer Science ISBN: 9783642214363 |
| Publisher Information: | Springer Berlin Heidelberg, 2011. |
| Publication Year: | 2011 |
| Description: | We recast each of the three standard denotational models of CSP, namely Traces, Stable Failures and Failures-Divergences, by replacing the \(\checkmark\) pseudo-event in each of them by an explicit representation of the termination traces of a process. The resulting recast models have simpler axiomatisations than their respective original counterparts and admit formulations of the compositional semantics of the basic processes and operators of CSP which are arguably clearer and therefore more intuitively appealing than those in the original models. Furthermore, the recast models facilitate the resolution of certain longstanding problematic issues, such as the offering of termination in an external choice alongside other behaviours, without resort to any incongruous special-casing which might compromise their regularity. |
| Document Type: | Part of book or chapter of book Article |
| DOI: | 10.1007/978-3-642-21437-0_22 |
| Access URL: | https://link.springer.com/content/pdf/10.1007%2F978-3-642-21437-0_22.pdf https://rd.springer.com/chapter/10.1007/978-3-642-21437-0_22 https://link.springer.com/chapter/10.1007/978-3-642-21437-0_22 |
| Rights: | Springer TDM |
| Accession Number: | edsair.doi.dedup.....3cba932b261a4dd4c36eae607c5d0673 |
| Database: | OpenAIRE |
| DOI: | 10.1007/978-3-642-21437-0_22 |
|---|