On the Axiomatizability of Impossible Futures: Preorder versus Equivalence

Authors:
Taolue Chen;Wan Fokkink
Affiliations:
-;-
Venue:
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Year:
2008

Citing 0
Cited 4

Ready to preorder: The case of weak process semantics

Information Processing Letters
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet

Information Processing Letters
Axiomatizing weak ready simulation semantics over BCCSP

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We provethat no finite, sound axiomatization for BCCSP modulo impossible futures equivalence is ground-complete. By contrast, we present a finite, sound, ground-complete axiomatization for BCCSP modulo impossible futures preorder. If the alphabet of actions is infinite, then this axiomatization is shown to be /piv-complete. If the alphabet is finite, we prove that the inequational theory of BCCSP modulo impossible futures preorder lacks such a finite basis. We also derive non-finite axiomatizability results for nested impossible futures semantics.