On Finite Bases for Weak Semantics: Failures versus Impossible Futures

Simple item page
dc.creatorChen, Taolue
dc.creatorFokkink, Wan
dc.creatorvan Glabbeek, Rob
dc.date2008-10-27
dc.date.accessioned2026-07-07T10:13:28Z
dc.date.available2026-07-07T10:13:28Z
dc.descriptionWe provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.
dc.identifierhttps://arxiv.org/abs/0810.4904
dc.identifierhttp://arxiv.org/abs/0810.4904
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172540
dc.subjectLogic in Computer Science
dc.titleOn Finite Bases for Weak Semantics: Failures versus Impossible Futures
dc.typetext

Files

Collections

arXiv