CCS in nominal logic

Jesper Bengtson 🌐

May 29, 2012

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

We formalise a large portion of CCS as described in Milner's book 'Communication and Concurrency' using the nominal datatype package in Isabelle. Our results include many of the standard theorems of bisimulation equivalence and congruence, for both weak and strong versions. One main goal of this formalisation is to keep the machine-checked proofs as close to their pen-and-paper counterpart as possible.

This entry is described in detail in Bengtson's thesis.

License

BSD License

Topics

Session CCS

Cite

× 
@article{CCS-AFP,
  author  = {Jesper Bengtson},
  title   = {CCS in nominal logic},
  journal = {Archive of Formal Proofs},
  month   = {May},
  year    = {2012},
  note    = {\url{https://isa-afp.org/entries/CCS.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: