A Branching Time Model of CSP

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

Abstract / Description of output

I present a branching time model of CSP that is finer than all other models of CSP proposed thus far. It is obtained by taking a semantic equivalence from the linear time -- branching time spectrum, namely divergence-preserving coupled similarity, and showing that it is a congruence for the operators of CSP. This equivalence belongs to the bisimulation family of semantic equivalences, in the sense that on transition systems without internal actions it coincides with strong bisimilarity. Nevertheless, enough of the equational laws of CSP remain to obtain a complete axiomatisation for closed, recursion-free terms.
Original languageEnglish
Title of host publicationConcurrency, Security, and Puzzles: Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday
EditorsThomas Gibson-Robinson, Philippa Hopcroft, Ranko Lazić
Place of PublicationCham
PublisherSpringer International Publishing Switzerland
Pages272-293
Number of pages22
ISBN (Electronic)978-3-319-51046-0
ISBN (Print)978-3-319-51045-3
DOIs
Publication statusPublished - 18 Dec 2016

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Cham
Volume10160
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'A Branching Time Model of CSP'. Together they form a unique fingerprint.

Cite this