Models for CSP with availability information

DOI10.1017/S0960129514000334MaRDI QIDQ2971074zbMATH OpenOpenAlexFDO

Authors Gavin Lowe

Publication date 4 April 2017

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1011.6434

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: 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.

Recommendations

• Models for CSP with availability information
• On timed models and full abstraction
• A branching time model of CSP
• Revivals, stuckness and the hierarchy of CSP models
• A hierarchy of failures-based models: theory and application

Cites work

• A calculus of communicating systems
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• Revivals, stuckness and the hierarchy of CSP models
• Testing equivalences for processes
• Understanding concurrent systems

Cited in

(1)

• Models for CSP with availability information

This page was built for publication: Models for CSP with availability information

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