Models for CSP with availability information

Gavin Lowe
(Oxford University)

We consider models of CSP based on recording what events are available as possible alternatives to the events that are actually performed. We present many different varieties of such models. For each, we give a compositional semantics, congruent to the operational semantics, and prove full abstraction and no-junk results. We compare the expressiveness of the different models.

In Sibylle Fröschle and Frank D. Valencia: Proceedings 17th International Workshop on Expressiveness in Concurrency (EXPRESS'10), Paris, France, August 30th, 2010, Electronic Proceedings in Theoretical Computer Science 41, pp. 91–105.
Published: 28th November 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.41.7 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org