Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Formalization of Unique Solutions of Equations in Process Algebra (1712.09402v1)

Published 5 Dec 2017 in cs.LO and cs.PL

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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.