{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:34:45Z","timestamp":1753889685465,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T00:00:00Z","timestamp":1442880000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>A general method is established to derive a ground-complete axiomatization\nfor a weak semantics from such an axiomatization for its concrete counterpart,\nin the context of the process algebra BCCS. This transformation moreover\npreserves omega-completeness. It is applicable to semantics at least as coarse\nas impossible futures semantics. As an application, ground- and omega-complete\naxiomatizations are derived for weak failures, completed trace and trace\nsemantics. We then present a finite, sound, ground-complete axiomatization for\nthe concrete impossible futures preorder, which implies a finite, sound,\nground-complete axiomatization for the weak impossible futures preorder. In\ncontrast, we prove that no finite, sound axiomatization for BCCS modulo\nconcrete and weak impossible futures equivalence is ground-complete. If the\nalphabet of actions is infinite, then the aforementioned ground-complete\naxiomatizations are shown to be omega-complete. If the alphabet is finite, we\nprove that the inequational theories of BCCS modulo the concrete and weak\nimpossible futures preorder lack such a finite basis.<\/jats:p>","DOI":"10.2168\/lmcs-11(3:17)2015","type":"journal-article","created":{"date-parts":[[2016,11,21]],"date-time":"2016-11-21T13:46:02Z","timestamp":1479735962000},"source":"Crossref","is-referenced-by-count":3,"title":["On the Axiomatizability of Impossible Futures"],"prefix":"10.46298","volume":"Volume 11, Issue 3","author":[{"given":"Taolue","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7443-8978","authenticated-orcid":false,"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[]},{"given":"Rob","family":"van Glabbeek","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2015,9,22]]},"reference":[{"key":"1120:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1593\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1593\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:07:32Z","timestamp":1681243652000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,22]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-11(3:17)2015","relation":{"is-same-as":[{"id-type":"arxiv","id":"1505.04985","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1505.04985","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2015,9,22]]},"article-number":"1593"}}