Axioms for Concurrency

@inproceedings{Moller2015AxiomsFC,
  title={Axioms for Concurrency},
  author={Faron Moller},
  year={2015}
}
We study properties of equational characterisations of congruences defined over process algebras. The languages on which we concentrate are based on CCS, and our equivalences are generally restricted to observational congruences. We start by defining and investigating the notion of extensionality or w-completeness of an axiomatisation with respect to some semantic equivalence, as an extension of simple completeness, and show that, whereas in some cases the ability to wcompletely axiomatise a… CONTINUE READING