On Finite Bases for Weak Semantics: Failures versus Impossible Futures
Logic in Computer Science
2008-10-28 v1
Abstract
We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.
Keywords
Cite
@article{arxiv.0810.4904,
title = {On Finite Bases for Weak Semantics: Failures versus Impossible Futures},
author = {Taolue Chen and Wan Fokkink and Rob van Glabbeek},
journal= {arXiv preprint arXiv:0810.4904},
year = {2008}
}