%T Using FDR to Model Check CSP\-Like Languages
%A  Thomas Gibson\-Robinson
%E Peter H. Welch,  Frederick R. M. Barnes,  Jan F. Broenink,  Kevin Chalmers,  Jan Bækgaard Pedersen,  Adam T. Sampson
%B Communicating Process Architectures 2013
%X This talk presents a demonstration of tyger, a tool that has
   been
constructed to allow a large class of CSP\-like
   languages to be
simulated in CSP.  In particular, FDR will
   be used to demonstrate
model checking of a simple CCS
   version of the classic Dining
Philosophers problem.  The
   theory behind this demonstration will be
presented in the
   paper \[dq]Efficient Simulation of CSP\-Like Languages\[dq].