On the axiomatizability of impossible futures
Chen, Taolue, Fokkink, Wan and Van Glabbeek, Rob J. (2015) On the axiomatizability of impossible futures. Logical Methods in Computer Science, 11 (3) . pp. 1-30. ISSN 1860-5974 [Article] (doi:10.2168/LMCS-11(3:17)2015)
|
PDF
- Final accepted version (with author's formatting)
Download (468kB) | Preview |
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 omega-completeness. It is applicable to semantics at least as coarse as impossible futures semantics. As an application, ground- and omega-complete axiomatizations are derived for weak failures, completed trace and trace semantics. We then present a finite, sound, ground-complete axiomatization for the concrete impossible futures preorder, which implies a finite, sound, ground-complete axiomatization for the weak impossible futures preorder. In contrast, we prove that no finite, sound axiomatization for BCCS modulo concrete and weak impossible futures equivalence is ground-complete. 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 prove that the inequational theories of BCCS modulo the concrete and weak impossible futures preorder lack such a finite basis.
Item Type: | Article |
---|---|
Additional Information: | Article number = Paper 17 |
Research Areas: | A. > School of Science and Technology > Computer Science > Foundations of Computing group |
Item ID: | 16755 |
Useful Links: | |
Depositing User: | Taolue Chen |
Date Deposited: | 03 Jun 2015 10:53 |
Last Modified: | 09 Jun 2021 14:12 |
URI: | https://eprints.mdx.ac.uk/id/eprint/16755 |
Actions (login required)
![]() |
View Item |
Statistics
Additional statistics are available via IRStats2.