On Finite Bases for Weak Semantics: Failures versus Impossible Futures
classification
💻 cs.LO
keywords
weakbccsfailuresfinitefuturesimpossiblemodulosemantics
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.