2000 character limit reached
On Finite Bases for Weak Semantics: Failures versus Impossible Futures
Published 27 Oct 2008 in cs.LO | (0810.4904v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.