Symbolic semantics for CSP

Communicating Sequential Processes (CSP) is a well-known formal language for describing concurrent systems, for which a transition semantics has been given by Brookes, Hoare and Roscoe. In this thesis, we present a generalized transition semantics of CSP, which we call HCSP, that merges the original transition system with ideas from Floyd-Hoare logic and symbolic computation. This generalized semantics is shown to be sound and complete with respect to the original trace semantics. Traces in our system are symbolic representations of trace families given in the original semantics. This more compact representation allows us to expand the original CSP systems to effectively and efficiently analyze some CSP programs that are difficult or impossible for other CSP systems to analyze. In particular, our system can handle certain classes of non-deterministic choices as a single transition, while the original semantics would treat each choice separately, possibly leading to large or unbounded case analyses. All the work described in this thesis, carried out in the theorem prover Isabelle, provides us with a framework for automated and interactive analyses of CSP processes. It also gives us the ability to extract Ocaml code for an HCSP-based simulator directly from Isabelle