2000 character limit reached
Further Formalization of the Process Algebra CCS in HOL4 (1707.04894v2)
Published 16 Jul 2017 in cs.LO
Abstract: In this project, we have extended previous work on the formalization of the process algebra CCS in HOL4. We have added full supports on weak bisimulation equivalence and observation congruence (rooted weak equivalence), with related definitions, theorems and algebraic laws. Some deep lemmas were also formally proved in this project, including Deng Lemma, Hennessy Lemma and several versions of the "Coarsest congruence contained in weak equivalence". For the last theorem, we have proved the full version (without any assumption) based on ordinals.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.