CSP is expressive enough for pi

CSP is expressive enough for pi

Bibliographic Details
Main Author:	Roscoe, A
Other Authors:	Jones, A
Format:	Journal article
Published:	2010

Similar Items

On the expressiveness of CSP
by: Roscoe, A
Published: (2011)

The expressiveness of CSP with priority
by: Roscoe, A
Published: (2015)

On the expressive power of CSP refinement
by: Roscoe, A
Published: (2003)

On the expressive power of CSP extended by priority
by: Roscoe, A
Published: (2014)

CSP files
by: Roscoe, T, et al.
Published: (2011)

Unbounded nondeterminism in CSP
by: Roscoe, A
Published: (1988)

Model−checking CSP
by: A. W. Roscoe
Published: (1994)

Unbounded nondeterminism in CSP
by: Roscoe, A, et al.
Published: (1989)

Developing and verifying protocols in CSP
by: Roscoe, A
Published: (1993)

An Operational Semantics for CSP
by: Roscoe, A, et al.
Published: (1986)

CSP and timewise refinement
by: Roscoe, A, et al.
Published: (1991)

Specifying problem one using the failures model for CSP and deriving CSP processes which meet this specification
by: Roscoe, A
Published: (1985)

Reflections on the need to de−skill CSP
by: Roscoe, A
Published: (2014)

Revivals, stuckness and the hierarchy of CSP models
by: Roscoe, A
Published: (2009)

Revivals‚stuckness and the hierarchy of CSP Models
by: Roscoe, A
Published: (2008)

A CSP solution to the trains problem
by: Roscoe, A
Published: (1985)

Compiling Shared Variable Programs into CSP
by: Roscoe, A
Published: (2001)

Checking noninterference in Timed CSP
by: Roscoe, A, et al.
Published: (2013)

The three platonic models of divergence-strict CSP
by: Roscoe, A
Published: (2008)

The three Platonic models of divergence−strict CSP
by: Roscoe, A
Published: (2008)

Internalising Agents in CSP Protocol Models
by: Roscoe, A, et al.
Published: (2002)

The timed failures - stability model for CSP
by: Reed, G, et al.
Published: (1999)

CSP files for payment protocols
by: Roscoe, B, et al.
Published: (2011)

Static Livelock Analysis in CSP
by: Ouaknine, J, et al.
Published: (2011)

Static livelock analysis in CSP
by: Ouaknine, J, et al.
Published: (2011)

Static Livelock Analysis in CSP
by: Ouaknine, J, et al.
Published: (2011)

Model checking Timed CSP
by: Armstrong, P, et al.
Published: (2012)

A taxonomy of web services in CSP
by: Roscoe, A, et al.
Published: (2005)

Communication and correctness in Timed CSP
by: Roscoe, A, et al.
Published: (1990)

SAT solving in CSP trace refinement
by: Palikareva, H, et al.
Published: (2012)

SAT−solving in CSP trace refinement
by: Palikareva, H, et al.
Published: (2011)

Translating timed automata to tock-CSP
by: Khattri, M, et al.
Published: (2011)

Translating Timed Automata to Tock−CSP
by: Khattri, M, et al.
Published: (2011)

SAT−Solving in CSP Trace Refinement
by: Palikareva, H, et al.
Published: (2012)

SAT-solving in CSP trace refinement
by: Palikareva, H, et al.
Published: (2012)

The timed failures−stability model for Timed CSP
by: Roscoe, A, et al.
Published: (1996)

Using CSP to detect errors in the TMN protocol
by: Roscoe, A, et al.
Published: (1996)

Verifying Statemate Statecharts Using CSP and FDR
by: Roscoe, A, et al.
Published: (2006)

Using CSP to Detect Errors in the TMN Protocol
by: Lowe, G, et al.
Published: (1997)

Timed CSP: Theory and Practice
by: Schneider, S, et al.
Published: (1991)