Trustworthy Systems

On finite bases for weak semantics: Failures versus impossible futures


Taolue Chen, Wan Fokkink and Rob van Glabbeek


Vrije Universiteit Amsterdam




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.

BibTeX Entry

    address          = {Spindleruv Mlyn, Czech Republic },
    author           = {Chen, Taolue and Fokkink, Wan and van Glabbeek, Robert},
    booktitle        = {35th Conference on Current Trends in Theory and Practice of Computer Science},
    editor           = {{M. Nielsen, A. Kucera, P. Bro Miltersen, C. Palamidessi, P. Tuma \& F. Valencia}},
    issn             = {0302-9743},
    keywords         = {concurrency, process algebra, bccs, labeled transition systems, complete axiomatizations, failures
                        semantics, impossible futures semantics.},
    month            = jan,
    pages            = {167--180},
    paperurl         = {},
    publisher        = {Springer},
    title            = {On Finite Bases for Weak Semantics: Failures versus Impossible Futures},
    year             = {2009}