2026-09-21T15:41:08Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/50630 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Gunter, Elsa L. Li, Liyi 2014-09-16T17:24:32Z 2014-09-16T17:24:32Z 2014-08 2014-09-16 2014-08 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. Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2014-07-18T22:05:12Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 master.pdf: 583053 bytes, checksum: f91c625780c5afcfe045fef424d968bf (MD5) Made available in DSpace on 2014-09-16T17:24:32Z (GMT). No. of bitstreams: 2 Liyi_Li.pdf: 583053 bytes, checksum: f91c625780c5afcfe045fef424d968bf (MD5) license.txt: 4056 bytes, checksum: 4290336f53970621aaca43cd3b78ecbc (MD5) http://hdl.handle.net/2142/50630 en 2014 by Liyi Li. All rights reserved. Communicating Sequential Processes (CSP) Process Algebra Symbolic Semantics Theorem Proving Simulator Symbolic semantics for CSP text Computer Science 1434 Computer Science 0112 University of Illinois at Urbana-Champaign Thesis M.S. MS:Computer Science -UIUC 10KS0112MS