SOFSEM 2009: Theory and Practice of Computer Science

Volume 5404 of the series Lecture Notes in Computer Science pp 167-180

On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

  • Taolue ChenAffiliated withCWI, Department of Software Engineering
  • , Wan FokkinkAffiliated withCWI, Department of Software EngineeringDepartment of Theoretical Computer Science, Vrije Universiteit Amsterdam
  • , Rob van GlabbeekAffiliated withNational ICT AustraliaSchool of Computer Science and Engineering, The University of New South Wales

* Final gross prices may vary according to local VAT.

Get Access


We 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.