A Formalization of Unique Solutions of Equations in Process Algebra

December 05, 2017 ยท The Ethereal ยท ๐Ÿ› arXiv.org

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Chun Tian arXiv ID 1712.09402 Category cs.LO: Logic in CS Cross-listed cs.PL Citations 1 Venue arXiv.org Last Checked 5 months ago
Abstract
In this thesis, a comprehensive formalization of Milner's Calculus of Communicating Systems (also known as CCS) has been done in HOL theorem prover (HOL4), based on an old work in HOL88. This includes all classical properties of strong/weak bisimulation equivalences and observation congruence, a theory of congruence for CCS, various versions of "bisimulation up to" techniques, and several deep theorems, namely the "coarsest congruence contained in weak equivalence", and three versions of the "unique solution of equations" theorem in Milner's book. This work is further extended to support recent developments in Concurrency Theory, namely the "contraction" relation and the related "unique solutions of contractions" theorem found by Prof. Davide Sangiorgi, University of Bologna. As a result, a rather complete theory of "contraction" (and a similar relation called "expansion") for CCS is also formalized in this thesis. Further more, a new variant of contraction called "observational contraction" was found by the author during this work, based on existing contraction relation. It's formally proved that, this new relation is preserved by direct sums of CCS processes, and has a more elegant form of the "unique solutions of contractions" theorem without any restriction on the CCS grammar.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS