On the axiomatizability of impossible futures

T. Chen, W. Fokkink, R. van Glabbeek

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
27 Downloads (Pure)

Abstract

A general method is established to derive a ground-complete axiomatization for a weak semantics from such an axiomatization for its concrete counterpart, in the context of the process algebra BCCS. This transformation moreover preserves ω completeness. It is applicable to semantics at least as coarse as impossible futures semantics. As an application, ground- and ω complete axiomatizations are derived for weak failures, completed trace and trace semantics. We then present a ω nite, sound, ground-complete axiomatization for the concrete impossible futures preorder, which implies a ω nite, sound, ground-complete axiomatization for the weak impossible futures preorder. In contrast, we prove that no ω nite, sound axiomatization for BCCS modulo concrete and weak impossible futures equivalence is ground-complete. If the alphabet of actions is in_nite, then the aforementioned ground- complete axiomatizations are shown to be ω complete. If the alphabet is ω nite, we prove that the inequational theories of BCCS modulo the concrete and weak impossible futures preorder lack such a ω nite basis.

Original languageEnglish
Article number17
Number of pages31
JournalLogical Methods in Computer Science
Volume11
Issue number3
DOIs
Publication statusPublished - 22 Sep 2015
Externally publishedYes

Keywords

  • Concurrency theory
  • Equational logic
  • Impossible futures
  • Process algebra

Fingerprint

Dive into the research topics of 'On the axiomatizability of impossible futures'. Together they form a unique fingerprint.

Cite this