English

Further Formalization of the Process Algebra CCS in HOL4

Logic in Computer Science 2017-07-28 v2

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.

Keywords

Cite

@article{arxiv.1707.04894,
  title  = {Further Formalization of the Process Algebra CCS in HOL4},
  author = {Chun Tian},
  journal= {arXiv preprint arXiv:1707.04894},
  year   = {2017}
}

Comments

24 pages with figures