On the Axiomatizability of Impossible Futures

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 omega-completeness. It is applicable to semantics at least as c...

Full description

Bibliographic Details
Main Authors: Taolue Chen, Wan Fokkink, Rob van Glabbeek
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2015-09-01
Series:Logical Methods in Computer Science
Subjects:
Online Access:https://lmcs.episciences.org/1593/pdf