We investigate the (in)equational theory of impossible fu- tures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for ...

May 19, 2015 · Abstract:A general method is established to derive a ground-complete axiomatization for a weak semantics from such an axiomatization for its ...

We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We provethat no finite, sound axiomatization for ...

Abstract. A general method is established to derive a ground-complete axiomatization for a weak semantics from such an axiomatization for its concrete ...

On the Axiomatizability of Impossible Futures: Preorder versus Equivalence · Taolue Chen, W. Fokkink · Published in 23rd Annual IEEE Symposium on… 1 March 2008 ...

We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for ...

We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We provethat no finite, sound axiomatization for ...

It is proved that no finite, sound axiomatization for BCCS modulo concrete and weak impossible futures equivalence is ground-complete, and if the alphabet ...

If the alphabet of actions is infinite, then the aforementioned ground-complete axiomatizations are shown to be omega-complete. If the alphabet is finite, we ...

Dec 18, 2024 · In contrast, we prove that no finite, sound axiomatization for BCCS modulo concrete and weak impossible futures equivalence is ground-complete.